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:
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.
The search session has expired. Please query the service again.
Displaying similar documents to “An algorithm for the word problem in extensions and the dependence of its complexity on the group representation”
Detecting the morphic images of a word : improving the general algorithm
A combinatorial theorem on -power-free words and an application to semigroups
Aldo de Luca, Stefano Varricchio (1990)
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:
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:
A linear-time algorithm to decide whether a binary word contains an overlap
A. J. Kfoury (1988)
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:
Enumeration of bordered words, le langage de la vache-qui-rit
M. Régnier (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: