Unavoidable languages, cuts and innocent sets of words
From MaRDI portal
Recommendations
Cites work
- An optimal test on finite unavoidable sets of words
- Avoidable patterns in strings of symbols
- Efficient string matching
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3911731 (Why is no real title available?)
- Inevitability in concurrent systems
- Inventories of unavoidable languages and the word-extension conjecture
- On extendibility of unavoidable sets
- On regularity of context-free languages
- On the synchronizing properties of certain prefix codes
- Ordering by Divisibility in Abstract Algebras
- The theory of well-quasi-ordering: a frequently discovered concept
- Uniqueness Theorems for Periodic Functions
- Using unavoidable set of trees to generalize Kruskal's theorem
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(9)- Testing avoidability on sets of partial words is hard
- Inventories of unavoidable languages and the word-extension conjecture
- Unavoidable sets of words of uniform length
- The chop of languages
- Minimum number of holes in unavoidable sets of partial words of size three
- Number of holes in unavoidable sets of partial words. I.
- Unavoidable sets of partial words of uniform length
- On the unavoidability of primitive words and other languages
- Unavoidable sets of partial words
This page was built for publication: Unavoidable languages, cuts and innocent sets of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858836)
