Maximal pattern complexity for Toeplitz words - Concepedia

Concepedia

Publication | Closed Access

Maximal pattern complexity for Toeplitz words

11

Citations

0

References

2006

Year

Nertila Gjini, Teturo Kamae, Bo Tan, Xue Yumei

Ergodic Theory and Dynamical Systems

Combinatorics On WordMaximal Pattern ComplexityDiscrete SpectraComputational ComplexityTime ComplexityDescriptional ComplexityDiscrete MathematicsKolmogorov ComplexityToeplitz WordsLinguistics

Abstract

The notion of the maximal pattern complexity of words was introduced by Kamae and Zamboni. In this paper, we obtain an almost exact formula for the maximal pattern complexity , while Toeplitz words in our sense always have discrete spectra.