Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet
Combinatorics
2015-07-16 v1 Formal Languages and Automata Theory
Abstract
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula determined by the characteristic polynomial.
Keywords
Cite
@article{arxiv.1507.03058,
title = {Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet},
author = {Bo Tan and Zhi-Xiong Wen and Yiping Zhang},
journal= {arXiv preprint arXiv:1507.03058},
year = {2015}
}
Comments
16 pages