Subword complexity of uniform D0L words over finite groups

DOI10.1016/J.TCS.2011.06.019zbMath1251.68131OpenAlexW1969268559MaRDI QIDQ719314

Ilya Goldstein

Publication date: 10 October 2011

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

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

zbMATH Keywords

permutationsfixed pointgroup theoryfinite automatasubword complexityinfinite wordsD0L wordsdisjoint covers of groupsgroup substitutions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• On the subword complexity of m-free DOL languages
• On the subword complexity of DOL languages with a constant distribution
• Asymptotic subword complexity of fixed points of group substitutions
• 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
• Complexity and special factors
• 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
• Reconnaissabilité des substitutions et complexité des suites automatiques

This page was built for publication: Subword complexity of uniform D0L words over finite groups