Asymptotic subword complexity of fixed points of group substitutions

DOI10.1016/j.tcs.2009.01.025zbMath1168.68025OpenAlexW1963866397MaRDI QIDQ1019186

Ilya Goldstein

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.025

zbMATH Keywords

fixed pointsubstitution systemsgroup theoryfinite automatasubword complexityD0L wordsgroup substitutionsstrongly multiplicative sequencesuniform substitutions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (4)

On the joint subword complexity of automatic sequences ⋮ Monochromatic arithmetic progressions in automatic sequences with group structure ⋮ Subword complexity of uniform D0L words over finite groups ⋮ On the D0L Repetition Threshold

Cites Work

• Unnamed Item
• Unnamed Item
• On the subword complexity of m-free DOL languages
• On the subword complexity of DOL languages with a constant distribution
• On the size of the alphabet and the subword complexity of square-free DOL languages
• On the subword complexity of square-free DOL languages
• On the subword complexity of locally catenative DOL languages
• Pascal's triangle, complexity and automata
• Complexity for finite factors of infinite sequences
• Complexity of sequences and dynamical systems
• On the complexity of infinite sequences
• Automata calculating the complexity of automatic sequences
• Arithmetical complexity of symmetric D0L words.
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• On some arithmetical properties of middle binomial coefficients
• Reconnaissabilité des substitutions et complexité des suites automatiques

This page was built for publication: Asymptotic subword complexity of fixed points of group substitutions