Asymptotic subword complexity of fixed points of group substitutions

Authors:
Ilya Goldstein
Affiliations:
Mathematical Department, Ben-Gurion University, Ben-Gurion 84105, Beer-Sheva, Israel
Venue:
Theoretical Computer Science
Year:
2009

Citing 5
Cited 2

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

On the joint subword complexity of automatic sequences

Theoretical Computer Science
Subword complexity of uniform D0L words over finite groups

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

The subword complexity of fixed points of some types of substitutions was studied by various authors. Here we introduce a family of substitutions, arising from multiplication tables of finite groups and other similar structures, and analyze their subword complexity.