Displaying similar documents to “Minimum complexity of automatic non sturmian sequences”

On parallel deletions applied to a word

Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa (1995)

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:

On ambiguity in DOS systems

Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)

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:

On the distribution of characteristic parameters of words II

Arturo Carpi, Aldo de Luca (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The characteristic parameters K w and R w of a word w over a finite alphabet are defined as follows: K w is the minimal natural number such that w has no repeated suffix of length K w and R w is the minimal natural number such that w has no right special factor of length R w . 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...