Number of holes in unavoidable sets of partial words. I.

DOI10.1016/j.jda.2011.12.001zbMath1273.68287OpenAlexW2057392423MaRDI QIDQ450546

Aleksandar Chakarov, Bob Chen, Francine Blanchet-Sadri

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.001

zbMATH Keywords

combinatorics on wordsautomata and formal languagespartial wordsunavoidable sets

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Crucial words and the complexity of some extremal problems for sets of prohibited words
• Unavoidable sets of partial words
• On regularity of context-free languages
• On extendibility of unavoidable sets
• Inventories of unavoidable languages and the word-extension conjecture
• An optimal test on finite unavoidable sets of words
• Unavoidable sets of words of uniform length
• A proof of Golomb's conjecture for the de Bruijn graph
• Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
• Unavoidable languages, cuts and innocent sets of words
• Algorithmic Combinatorics on Partial Words
• UNAVOIDABLE SETS OF CONSTANT LENGTH
• Unavoidable sets