Displaying similar documents to “Counting bordered partial words by critical positions.”

Density of Critical Factorizations

Tero Harju, Dirk Nowotka (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We investigate the density of critical factorizations of infinite sequences of words. The density of critical factorizations of a word is the ratio between the number of positions that permit a critical factorization, and the number of all positions of a word. We give a short proof of the Critical Factorization Theorem and show that the maximal number of noncritical positions of a word between two critical ones is less than the period of that word. Therefore, we consider only...

Density of critical factorizations

Tero Harju, Dirk Nowotka (2002)

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

Similarity:

We investigate the density of critical factorizations of infinite sequences of words. The density of critical factorizations of a word is the ratio between the number of positions that permit a critical factorization, and the number of all positions of a word. We give a short proof of the Critical Factorization Theorem and show that the maximal number of noncritical positions of a word between two critical ones is less than the period of that word. Therefore, we consider only words of...

On extremal properties of the Fibonacci word

Julien Cassaigne (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

We survey several quantitative problems on infinite words related to repetitions, recurrence, and palindromes, for which the Fibonacci word often exhibits extremal behaviour.