Unavoidable sets of words of uniform length
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3159594 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- An optimal test on finite unavoidable sets of words
- On extendibility of unavoidable sets
- On the synchronizing properties of certain prefix codes
- Unavoidable languages, cuts and innocent sets of words
Cited in
(21)- Unavoidable languages, cuts and innocent sets of words
- Unavoidable sets and conjugacy classes
- scientific article; zbMATH DE number 4072416 (Why is no real title available?)
- The length of short words in unavoidable sets
- Uniform words
- Unavoidable regularities and factor permutations of words
- scientific article; zbMATH DE number 2051155 (Why is no real title available?)
- Minimum number of holes in unavoidable sets of partial words of size three
- Generating of minimal unavoidable sets
- Unavoidable sets
- Unavoidable regularities in long words with bounded number of symbol occurrences
- Bounds on Zimin word avoidance
- UNAVOIDABLE SETS OF CONSTANT LENGTH
- UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
- Unavoidable sets
- Unavoidable sets of partial words of uniform length
- On real-time cellular automata and trellis automata
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- Number of holes in unavoidable sets of partial words. I.
- Number of holes in unavoidable sets of partial words. II.
- scientific article; zbMATH DE number 736284 (Why is no real title available?)
This page was built for publication: Unavoidable sets of words of uniform length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854517)
