Abelian maximal pattern complexity of words
classification
🧮 math.CO
math.DS
keywords
wordsabeliancomplexitymaximalpatternaperiodicboundinfinite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.