The complexity of unavoidable word patterns
From MaRDI portal
Publication:2158299
DOI10.1007/S00224-022-10090-ZOpenAlexW4283361228MaRDI QIDQ2158299FDOQ2158299
Publication date: 26 July 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07431
Recommendations
Cites Work
- Avoidable patterns in strings of symbols
- BLOCKING SETS OF TERMS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- INFINITE PERIODIC GROUPS. I
- Title not available (Why is that?)
- Some unsolved problems
- Open Problems in Pattern Avoidance
- Nonrepetitive colorings of graphs
- Abelian squares are avoidable on 4 letters
- Title not available (Why is that?)
- Title not available (Why is that?)
- 2726. A problem on strings of beads
- Unavoidable regularities and factor permutations of words
- Tower-type bounds for unavoidable patterns in words
- On nonrepetitive sequences
- Unending chess, symbolic dynamics and a problem in semi-groups
- Embedding the Dual of Π m in the Lattice of Equational Classes of Commutative Semigroups
- Intervals in the lattice of varieties
- On repetitions of blocks in binary sequences
- Title not available (Why is that?)
- Examples of varieties of semigroups
- On the Complexity of Deciding Avoidability of Sets of Partial Words
- Title not available (Why is that?)
- Square-free and cube-free colorings of the ordinals
- Searching for Zimin patterns
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on Zimin Word Avoidance
Cited In (3)
This page was built for publication: The complexity of unavoidable word patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158299)
