UNAVOIDABLE SETS OF CONSTANT LENGTH
From MaRDI portal
Recommendations
Cites work
- A proof of Golomb's conjecture for the de Bruijn graph
- An Introduction to Symbolic Dynamics and Coding
- Factorizing words over an ordered alphabet
- Inventories of unavoidable languages and the word-extension conjecture
- On the synchronizing properties of certain prefix codes
- Unavoidable sets of words of uniform length
Cited in
(22)- Unions of sets of lengths.
- Unavoidable sets and conjugacy classes
- Open maps: small and large holes with unusual properties
- Unavoidable sets of words of uniform length
- A characterization of binary morphisms generating Lyndon infinite words
- Minimum number of holes in unavoidable sets of partial words of size three
- The length of short words in unavoidable sets
- Avoiding conjugacy classes on the 5-letter alphabet
- On the Complexity of Deciding Avoidability of Sets of Partial Words
- Lyndon words and Fibonacci numbers
- Random subshifts of finite type
- scientific article; zbMATH DE number 2051155 (Why is no real title available?)
- Number of holes in unavoidable sets of partial words. I.
- Number of holes in unavoidable sets of partial words. II.
- Unavoidable Set: Extension and Reduction
- Unavoidable sets of partial words of uniform length
- Lower density selection schemes via small universal hitting sets with short remaining path length
- UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
- Unavoidable sets
- Unavoidable sets
- On the complexity of deciding avoidability of sets of partial words
- On prefix normal words and prefix normal forms
This page was built for publication: UNAVOIDABLE SETS OF CONSTANT LENGTH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692237)
