We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics rangin...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...