An optimal test on finite unavoidable sets of words

DOI10.1016/0020-0190(83)90119-9zbMath0506.68057OpenAlexW2010820635WikidataQ61677990 ScholiaQ61677990MaRDI QIDQ1836993

Philippe Wender, Maxime Crochemore, Michel Le Rest

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90119-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Inventories of unavoidable languages and the word-extension conjecture, Unavoidable languages, cuts and innocent sets of words, Unnamed Item, Number of holes in unavoidable sets of partial words. I., Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, Unavoidable sets of words of uniform length

Cites Work

• Avoidable patterns in strings of symbols
• On the synchronizing properties of certain prefix codes
• Unnamed Item
• Unnamed Item