Elementariness of a finite set of words is co-NP-complete
Jean Neraud (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On the periodicity of morphisms on free monoids”
Elementariness of a finite set of words is co-NP-complete
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:
Associative closure and periodicity of -words
A. Mateescu, G. D. Mateescu (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decimations and sturmian words
Jacques Justin, Giuseppe Pirillo (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decidability of periodicity for infinite words
Jean-Jacques Pansiot (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:
Commutativity in groups presented by finite Church-Rosser Thue systems
Klaus Madlener, Friedrich Otto (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: