Decidability of periodicity for infinite words
Jean-Jacques Pansiot (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Associative closure and periodicity of -words”
Decidability of periodicity for infinite 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:
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:
The decidability of the equivalence problem for polynomially bounded DOL sequences
Juhani Karhumäki (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On ambiguity in DOS systems
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: