• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Ultimately Constant Abelian Complexity of Infinite Words

Aleksi Saarela, Ultimately Constant Abelian Complexity of Infinite Words. Journal of Automata, Languages and Combinatorics 14(3-4), 255–258, 2010.

Abstract:

It is known that there are recurrent words with constant abelian complexity three,
but not with constant complexity four. We prove that there are recurrent words with
ultimately constant complexity c for every c.

BibTeX entry:

@ARTICLE{jSaarela10a,
  title = {Ultimately Constant Abelian Complexity of Infinite Words},
  author = {Saarela, Aleksi},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume = {14},
  number = {3-4},
  pages = {255–258},
  year = {2010},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 1

Edit publication