Unavoidable languages, cuts and innocent sets of words
From MaRDI portal
Publication:4858836
DOI10.1051/ita/1995290503391zbMath0838.68068OpenAlexW34860892MaRDI QIDQ4858836
Publication date: 20 December 1995
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92513
Related Items
Inventories of unavoidable languages and the word-extension conjecture ⋮ 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 partial words ⋮ Testing avoidability on sets of partial words is hard ⋮ Unavoidable sets of words of uniform length
Cites Work
- 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
- Inventories of unavoidable languages and the word-extension conjecture
- 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
- 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
