Where academic tradition
meets the exciting future

Combinatorics on Infinite Words

Juhani Karhumäki, Arto Lepistö, Combinatorics on Infinite Words. TUCS Technical Reports 578, Turku Centre for Computer Science, 2003.

Abstract:

We consider several problems of infinite words over a finite
alphabet. In particular, we describe a few automata-theoretic
methods to define infinite words. Properties of infinite words
studied in more details are repetition-freeness, periodicity and
different kinds of complexity issues. Examples are used to
illustrate the power of infinite words in many applications, as
well as illustrations of problems of different areas of
mathematics.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tKaLe03a,
  title = {Combinatorics on Infinite Words},
  author = {Karhumäki, Juhani and Lepistö, Arto},
  number = {578},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2003},
  ISBN = {952-12-1282-9},
}

Belongs to TUCS Research Unit(s): Other

Edit publication