Article contents
Abelian maximal pattern complexity of words
Published online by Cambridge University Press: 13 August 2013
Abstract
In this paper, we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection. We show that in the case of binary words, the bound is actually achieved and gives a characterization of recurrent aperiodic words.
- Type
- Research Article
- Information
- Copyright
- © Cambridge University Press, 2013
References
- 2
- Cited by