Bispecial factors in circular non-pushy D0L languages

DOI10.1016/J.TCS.2012.05.007MaRDI QIDQ442285zbMATHOpenAlexFDO

Authors Karel Klouda

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

zbMATH Keywords

critical exponentbispecial factorscircular D0L systemsnon-pushy D0L systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Abstract: We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent.

Recommendations

• scientific article; zbMATH DE number 1740040
• Characterization of circular D0L-systems
• scientific article; zbMATH DE number 1234887
• If a DOL language is k-power free then it is circular
• Bispecial factors in the Brun \(S\)-adic system

Cites work

• scientific article; zbMATH DE number 3974304 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1740040 (Why is no real title available?)
• scientific article; zbMATH DE number 5051582 (Why is no real title available?)
• Complexity and special factors
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• If a DOL language is k-power free then it is circular
• On critical exponents in fixed points of non-erasing morphisms
• On the factors of the Thue-Morse word on three symbols
• Repetition of subwords in DOL languages
• Repetitions in beta-integers
• Sequences generated by infinitely iterated morphisms
• Weakly Mixing Transformations Which are Not Strongly Mixing

Cited in

(12)

• Non-injectivity of infinite interval exchange transformations and generalized Thue-Morse sequences
• On Morphisms Preserving Palindromic Richness
• Maximal bifix decoding
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
• Morphisms generating antipalindromic words
• Synchronizing delay for binary uniform morphisms
• Suffix conjugates for a class of morphic subshifts
• Palindromic richness for languages invariant under more symmetries
• If a DOL language is k-power free then it is circular
• Bispecial factors in the Brun \(S\)-adic system
• On Substitutions Preserving Their Return Sets
• Palindromic sequences generated from marked morphisms

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Bispecial factors in circular non-pushy D0L languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442285)