Bispecial factors in circular non-pushy D0L languages
From MaRDI portal
Publication:442285
DOI10.1016/j.tcs.2012.05.007zbMath1279.68160arXiv1201.1186MaRDI QIDQ442285
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.1186
Related Items
On Morphisms Preserving Palindromic Richness, On Substitutions Preserving Their Return Sets, Non-injectivity of infinite interval exchange transformations and generalized Thue-Morse sequences, Palindromic richness for languages invariant under more symmetries, Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm, Palindromic sequences generated from marked morphisms, Synchronizing delay for binary uniform morphisms, Morphisms generating antipalindromic words, Maximal bifix decoding, Bispecial Factors in the Brun S-Adic System, Suffix conjugates for a class of morphic subshifts
Uses Software
Cites Work
- On critical exponents in fixed points of non-erasing morphisms
- Repetitions in beta-integers
- Sequences generated by infinitely iterated morphisms
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Complexity and special factors
- On the factors of the Thue-Morse word on three symbols
- Repetition of subwords in DOL languages
- If a DOL language is k-power free then it is circular
- Weakly Mixing Transformations Which are Not Strongly Mixing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item