On the periodicity of morphisms on free monoids
Tero Harju, Matti Linna (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Elementariness of a finite set of words is co-NP-complete”
On the periodicity of morphisms on free monoids
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:
Detecting the morphic images of a word : improving the general algorithm
Jean Néraud (1997)
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:
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:
Reduction algorithms for some classes of aperiodic monoids
Roman König (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the Ehrenfeucht conjecture for DOL languages
Karel Ii Culik, Juhani Karhumäki (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: