Asymptotic subword complexity of fixed points of group substitutions
type: Item
instance of: scholarly article
title: Asymptotic subword complexity of fixed points of group substitutions
zbMATH Open document ID: 1168.68025
author: Ilya Goldstein
published in: Theoretical Computer Science
publication date: 2009-05-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5558991
zbMATH Keywords: D0L words
zbMATH Keywords: finite automata
zbMATH Keywords: fixed point
zbMATH Keywords: group theory
zbMATH Keywords: substitution systems
zbMATH Keywords: subword complexity
zbMATH Keywords: strongly multiplicative sequences
zbMATH Keywords: uniform substitutions
zbMATH Keywords: group substitutions
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.01.025
OpenAlex ID: W1963866397
cites work: On the complexity of infinite sequences
cites work: Pascal's triangle, complexity and automata
cites work: On some arithmetical properties of middle binomial coefficients
cites work: Q3023979
cites work: On the subword complexity of DOL languages with a constant distribution
cites work: On the subword complexity of square-free DOL languages
cites work: On the subword complexity of locally catenative DOL languages
cites work: On the subword complexity of m-free DOL languages
cites work: On the size of the alphabet and the subword complexity of square-free DOL languages
cites work: Complexity of sequences and dynamical systems
cites work: Complexity for finite factors of infinite sequences
cites work: Arithmetical complexity of symmetric D0L words.
cites work: Q4221611
cites work: Reconnaissabilité des substitutions et complexité des suites automatiques
cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés
cites work: Automata calculating the complexity of automatic sequences
DOI: 10.1016/J.TCS.2009.01.025
description: scientific article; zbMATH DE number 5558991