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:
Aldo de Luca, Stefano Varricchio (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jacques Justin, Giuseppe Pirillo (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
J. Berstel, P. Séébold (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Arturo Carpi, Aldo de Luca (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The characteristic parameters and of a word over a finite alphabet are defined as follows: is the minimal natural number such that has no repeated suffix of length and is the minimal natural number such that has no right special factor of length . In a previous paper, published on this journal, we have studied the distributions of these parameters, as well as the distribution of the maximal length of a repetition, among the words of each length on a given alphabet. In...
Anton Černý (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: