On long words avoiding Zimin patterns
From MaRDI portal
Publication:2321925
DOI10.1007/S00224-019-09914-2zbMATH Open1431.68101OpenAlexW2922149981MaRDI QIDQ2321925FDOQ2321925
Publication date: 27 August 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7014/
Recommendations
Cites Work
- Analytic combinatorics
- Avoidable patterns in strings of symbols
- BLOCKING SETS OF TERMS
- The probabilistic method
- Pattern avoidance: themes and variations
- On long words avoiding Zimin patterns
- On Long Words Avoiding Zimin Patterns
- Tower-type bounds for unavoidable patterns in words
- The Complexity of Translating Logic to Finite Automata
- Avoiding patterns in the abelian sense
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Title not available (Why is that?)
- Searching for Zimin patterns
- Bounds on Zimin Word Avoidance
- Equivalences of Pushdown Systems Are Hard
- Asymptotic Density of Zimin Words
- Title not available (Why is that?)
Cited In (8)
- Defining long words succinctly in FO and MSO
- Long unavoidable patterns
- Title not available (Why is that?)
- On long words avoiding Zimin patterns
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- On Long Words Avoiding Zimin Patterns
- Title not available (Why is that?)
- Unavoidable regularities in long words with bounded number of symbol occurrences
This page was built for publication: On long words avoiding Zimin patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321925)
