Related papers: On the interplay between Babai and Cerny's conject…
We investigate the transition monoid construction for deterministic automata in a categorical setting and establish it as an adjunction. We pair this adjunction with two other adjunctions to obtain two endofunctors on deterministic…
A synchronizing word for an automaton is a word that brings that automaton into one and the same state, regardless of the starting position. Cerny conjectured in 1964 that if a n-state deterministic automaton has a synchronizing word, then…
Let S be a polynomial ring and R=S/I where I is a graded ideal of S. The Multiplicity Conjecture of Herzog, Huneke, and Srinivasan which was recently proved using the Boij-Soederberg theory states that the multiplicity of R is bounded above…
We show that every two-way deterministic finite automaton (2DFA) that solves one-way liveness on height h has Omega(h^2) states. This implies a quadratic lower bound for converting one-way nondeterministic finite automata to 2DFAs, which…
We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is important for reasoning about structures that use data values…
A turn in a computation of a pushdown automaton is a switch from a phase in which the height of the pushdown store increases to a phase in which it decreases. Given a pushdown or one-counter automaton, we consider, for each string in its…
Recent experiments by Springer and Kenyon have shown that a deep neural network can be trained to predict the action of $t$ steps of Conway's Game of Life automaton given millions of examples of this action on random initial states.…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…
We introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown automaton, but can observe the contents of the stack. The…
In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…
A central question in the theory of automata is which classes of automata can be minimized in polynomial time. We close the remaining gaps for deterministic and history-deterministic automata over infinite words by proving that…
We compute the entanglement entropy in a 2+1 dimensional topological order in the presence of gapped boundaries. Specifically, we consider entanglement cuts that cut through the boundaries. We argue that based on general considerations of…
We study the von Neumann and R\'enyi bipartite entanglement entropies in the thermodynamic limit of many-body quantum states with spin-s sites, that possess full symmetry under exchange of sites. It turns out that there is essentially a…
We propose several heuristics for mitigating one of the main causes of combinatorial explosion in rank-based complementation of B\"{u}chi automata (BAs): unnecessarily high bounds on the ranks of states. First, we identify elevator…
Bernoulli convolutions are certain measures on the unit interval depending on a parameter $\beta$ between 1 and 2. In spite of their simple definition, they are not yet well understood. We study their two-dimensional density which exists by…
Tile Automata is a recently defined model of self-assembly that borrows many concepts from cellular automata to create active self-assembling systems where changes may be occurring within an assembly without requiring attachment. This model…
A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an…
Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…
In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing…