Inventories of unavoidable languages and the word-extension conjecture

DOI10.1016/S0304-3975(97)00031-5zbMath0902.68099WikidataQ123267438 ScholiaQ123267438MaRDI QIDQ1129010

Laurent Rosaz

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

unavoidable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, etc. in computability and recursion theory (03D40)

Related Items (9)

Unavoidable languages, cuts and innocent sets of words ⋮ Unnamed Item ⋮ Number of holes in unavoidable sets of partial words. I. ⋮ UNAVOIDABLE SETS OF CONSTANT LENGTH ⋮ Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three ⋮ Unavoidable sets ⋮ Unavoidable sets of partial words ⋮ Testing avoidability on sets of partial words is hard ⋮ Unavoidable Set: Extension and Reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regularity of context-free languages
• On extendibility of unavoidable sets
• Inevitability in concurrent systems
• Using unavoidable set of trees to generalize Kruskal's theorem
• Avoidable patterns in strings of symbols
• An optimal test on finite unavoidable sets of words
• The theory of well-quasi-ordering: a frequently discovered concept
• Efficient string matching
• Unavoidable languages, cuts and innocent sets of words
• Uniqueness Theorems for Periodic Functions
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• On the synchronizing properties of certain prefix codes
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Inventories of unavoidable languages and the word-extension conjecture