Subword complexity of uniform D0L words over finite groups

Authors:
Ilya Goldstein
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2011

Citing 6
Cited 0

Complexity for finite factors of infinite sequences

Theoretical Computer Science
On the frequency of factors in a D0L word

Journal of Automata, Languages and Combinatorics
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés

Proceedings of the 11th Colloquium on Automata, Languages and Programming
On Uniform DOL Words

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Arithmetical complexity of symmetric D0L words

Theoretical Computer Science
Asymptotic subword complexity of fixed points of group substitutions

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We deal with the subword complexity of uniform D0L words obtained from group substitutions. Our main interest is whether the subword complexity is ''almost proportional'' to the length of the factor. We find necessary and sufficient conditions for that. For some cases we show that this is impossible.