Density of Critical Factorizations

DOI10.1051/ita:2002016zbMath1013.68154OpenAlexW1981820432WikidataQ114105528 ScholiaQ114105528MaRDI QIDQ4800261

Dirk Nowotka, Tero J.Harju

Publication date: 2 April 2003

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2002__36_3_315_0

zbMATH Keywords

critical factorizationinfinite sequences of words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

Fully bordered words ⋮ Critical factorisation in square-free words ⋮ The structure of subword graphs and suffix trees of Fibonacci words ⋮ Partial words and the critical factorization theorem revisited ⋮ Border correlation of binary words ⋮ On unique factorizations of primitive words. ⋮ Partial words and the critical factorization theorem ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ On the number of frames in binary words ⋮ Periods in extensions of words ⋮ USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial property of the Fibonacci words
• Periodes et repetitions des mots du monoide libre
• Two-way string-matching

This page was built for publication: Density of Critical Factorizations