Unavoidable sets of words of uniform length

DOI10.1006/inco.2001.3123zbMath1009.68105OpenAlexW2090661785MaRDI QIDQ1854517

C. J. Saker, Peter M. Higgins

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3123

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Crucial words and the complexity of some extremal problems for sets of prohibited words, Unnamed Item, Number of holes in unavoidable sets of partial words. I., Number of holes in unavoidable sets of partial words. II., UNAVOIDABLE SETS OF CONSTANT LENGTH, Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, Unavoidable sets

Cites Work

• On extendibility of unavoidable sets
• An optimal test on finite unavoidable sets of words
• Unavoidable languages, cuts and innocent sets of words
• On the synchronizing properties of certain prefix codes
• Unnamed Item
• Unnamed Item
• Unnamed Item