2 papers
math.CO2015
Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet
Bo Tan, Zhi-Xiong Wen, Yiping Zhang
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…
math.GR2002
Decomposition theorem for invertible substitutions on three-letter alphabet
B. Tan, Z. -X. Wen, Y. -P. Zhang
We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a…