UNAVOIDABLE SETS OF CONSTANT LENGTH

DOI10.1142/S0218196704001700zbMath1101.68072MaRDI QIDQ5692237

Georges Hansel, Dominique Perrin, Jean-Marc Champarnaud

Publication date: 27 September 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

Lyndon wordsCombinatorics on wordsDeBruijn graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length, A characterization of binary morphisms generating Lyndon infinite words, On the complexity of deciding avoidability of sets of partial words, Lyndon words and Fibonacci numbers, Random subshifts of finite type, Unnamed Item, Number of holes in unavoidable sets of partial words. I., Number of holes in unavoidable sets of partial words. II., Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS, Open maps: small and large holes with unusual properties, On prefix normal words and prefix normal forms, Unavoidable sets, On the Complexity of Deciding Avoidability of Sets of Partial Words, THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS

Cites Work

• Inventories of unavoidable languages and the word-extension conjecture
• Unavoidable sets of words of uniform length
• A proof of Golomb's conjecture for the de Bruijn graph
• Factorizing words over an ordered alphabet
• An Introduction to Symbolic Dynamics and Coding
• On the synchronizing properties of certain prefix codes