Inventories of unavoidable languages and the word-extension conjecture
From MaRDI portal
Publication:1129010
DOI10.1016/S0304-3975(97)00031-5zbMATH Open0902.68099WikidataQ123267438 ScholiaQ123267438MaRDI QIDQ1129010FDOQ1129010
Authors: Laurent Rosaz
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Word problems, etc. in computability and recursion theory (03D40)
Cites Work
- Efficient string matching
- Avoidable patterns in strings of symbols
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- The theory of well-quasi-ordering: a frequently discovered concept
- Ordering by Divisibility in Abstract Algebras
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- 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
- On regularity of context-free languages
- Title not available (Why is that?)
- Using unavoidable set of trees to generalize Kruskal's theorem
- Inevitability in concurrent systems
- Title not available (Why is that?)
Cited In (12)
- UNAVOIDABLE SETS OF CONSTANT LENGTH
- On the unavoidability of primitive words and other languages
- Unavoidable sets
- On real-time cellular automata and trellis automata
- Unavoidable languages, cuts and innocent sets of words
- Number of holes in unavoidable sets of partial words. I.
- Unavoidable sets of partial words
- Testing avoidability on sets of partial words is hard
- Minimum number of holes in unavoidable sets of partial words of size three
- Unavoidable Set: Extension and Reduction
- Title not available (Why is that?)
- Unavoidable sets of partial words of uniform length
This page was built for publication: Inventories of unavoidable languages and the word-extension conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129010)