The Maximal Subword Complexity of Quasiperiodic Infinite Words
Formal Languages and Automata Theory
2010-08-11 v1 Discrete Mathematics
Information Theory
math.IT
Abstract
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived from q. It is shown that this language is a suffix code having a bounded delay of decipherability. Our estimate of the subword complexity now follows from this result, previously known results on the subword complexity and elementary results on formal power series.
Keywords
Cite
@article{arxiv.1008.1659,
title = {The Maximal Subword Complexity of Quasiperiodic Infinite Words},
author = {Ronny Polley and Ludwig Staiger},
journal= {arXiv preprint arXiv:1008.1659},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270