Critical exponents of words over 3 letters.
Vaslet, Elise (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Counting bordered partial words by critical positions.”
Critical exponents of words over 3 letters.
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...
For each there is an infinite binary word with critical exponent .
Currie, James D., Rampersad, Narad (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Lyndon factorization of the Thue-Morse word and its relatives.
Ido, Augustin, Melançon, Guy (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The critical exponent of the Arshon words
Dalia Krieger (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
Generalizing the results of Thue (for ) [Norske Vid. Selsk. Skr. Mat. Nat. Kl. (1912) 1–67] and of Klepinin and Sukhanov (for ) [Discrete Appl. Math. (2001) 155–169], we prove that for all ≥ 2, the critical exponent of the Arshon word of order is given by (3–2)/(2–2), and this exponent is attained at position 1.
Enumeration schemes for words avoiding patterns with repeated letters.
Pudwell, Lara (2008)
Integers
Similarity: