scientific article; zbMATH DE number 7443999

zbMath1483.68268arXiv1708.06459MaRDI QIDQ5016356

Joey Becker, Stephen Watkins, Laure Flapan, Francine Blanchet-Sadri

Publication date: 13 December 2021

Full work available at URL: https://arxiv.org/abs/1708.06459

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Number of holes in unavoidable sets of partial words. I.
• Number of holes in unavoidable sets of partial words. II.
• Crucial words and the complexity of some extremal problems for sets of prohibited words
• On the complexity of deciding avoidability of sets of partial words
• Unavoidable sets of partial words
• Testing avoidability on sets of partial words is hard
• 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
• THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS
• Unavoidable languages, cuts and innocent sets of words
• Algorithmic Combinatorics on Partial Words
• UNAVOIDABLE SETS OF CONSTANT LENGTH
• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
• Unavoidable sets