Related papers: Decision Problems for Recognizable Languages of In…
A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
The First Hilbert problem is studied in this paper by applying two instruments: a new methodology distinguishing between mathematical objects and mathematical languages used to describe these objects; and a new numeral system allowing one…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…
Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
In this paper, we establish a strong link between the ambiguity for finite words of a B\"uchi automaton and the ambiguity for infinite words of the same automaton. This link is based on measure theory. More precisely, we show that such an…
We define a quantum computational model over infinite words, called Measure-Many Quantum B\"uchi Automata (MMQBA), which extends Measure-many Quantum Finite automata (MMQFA) to the infinite word setting with B\"uchi acceptance condition. In…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
Recent studies show that deep vision-only and language-only models--trained on disjoint modalities--nonetheless project their inputs into a partially aligned representational space. Yet we still lack a clear picture of where in each network…
Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…
Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive…
We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…