We investigate several questions related to the notion of recognizable morphism. The main
result is a new proof of Mossé's theorem and actually of a generalization to a more general …

An S-adic system is a symbolic dynamical system generated by iterating an infinite
sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic …

We prove that given a set X of two nonempty words, a set Y of nonempty words commutes
with X if and only if either Y is a union of powers of X or X, Y⊆ t+ for some primitive word t …

We investigate questions related to the notion of recognizability of sequences of morphisms,
a generalization of Moss {\'e}'s Theorem. We consider the most general class of morphisms …

We study mortal words and words of minimum non-zero rank (in particular, synchronizing
words) in strongly connected unambiguous automata. We show that every n-state strongly …

Let X be a two-element set of words over a finite alphabet. If a bi-infinite word possesses two
X-factorizations which are not shiftequivalent, then the primitive roots of the words in X are …

We obtain several lower bounds on the language recognition power of Nayak's generalized
quantum finite automata (GQFA)[12]. Techniques for proving lower bounds on Kondacs and …

We consider the defect theorem in the context of labelled polyominoes, ie, two-dimensional
figures. The classical version of this property states that if a set of n words is not a code then …

We prove that if X is a finite prefix set and w is a non-periodic bi-infinite word, possessing 3
disjoint X-factorizations, then the combinatorial rank of X is at most card (X)− 2. This is one of …

Combinatorics on words in one dimension is a well-studied subfield of theoretical computer
science with its origins in the early 20th century. However, the closely-related study of two …