On the context-freeness of the set of words containing overlaps
From MaRDI portal
Publication:845966
DOI10.1016/j.ipl.2006.11.008zbMath1184.68330arXivmath/0610067OpenAlexW2065040823MaRDI QIDQ845966
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610067
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subword complexity of a generalized Thue-Morse word
- Binary words containing infinitely many overlaps
- Analytic models and ambiguity of context-free languages
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Enumeration of irreducible binary words
- The Morse sequence and iterated morphisms
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Transcendence of formal power series with rational coefficients
- Canonical positions for the factors in paperfolding sequences
- Automata calculating the complexity of automatic sequences
- Enumeration of factors in the Thue-Morse word
- On the structure of the counting function of sparse context-free languages.
- Unending chess, symbolic dynamics and a problem in semi-groups
- An “Interchange Lemma” for Context-Free Languages
- A linear-time algorithm to decide whether a binary word contains an overlap
- Suites algébriques, automates et substitutions
- A result about languages concerning paperfolding sequences
- Reconnaissabilité des substitutions et complexité des suites automatiques
- The subword complexity of fixed points of binary uniform morphisms
- On the base-dependence of sets of numbers recognizable by finite automata
- On the subword complexity of iteratively generated infinite words.
