Associative closure and periodicity of -words
A. Mateescu, G. D. Mateescu (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Decidability of periodicity for infinite words”
Associative closure and periodicity of -words
Decimations and sturmian words
Jacques Justin, Giuseppe Pirillo (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the periodicity of morphisms on free monoids
Tero Harju, Matti Linna (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the equality sets for homomorphisms on free monoids with two generators
K. Culik II, J. Karhumäki (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A remark on morphic sturmian words
J. Berstel, P. Séébold (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
Gérard Jacob (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: