On the average minimal prefix-length of the generalized semi-Dycklanguage
Rainer Kemp (1996)
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.
Displaying similar documents to “Generic result for the existence of a free semi-group”
On the average minimal prefix-length of the generalized semi-Dycklanguage
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:
Semi-commutations and partial commutations
M. Clerbout, Y. Roos, I. Ryl (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Partially abelian squarefree words
Robert Cori, Maria Rosaria Formisano (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
An algorithm for the word problem in extensions and the dependence of its complexity on the group representation
J. Avenhaus, K. Madlener (1981)
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: