On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
Discrete Mathematics
2007-05-23 v1 Logic in Computer Science
Abstract
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.
Keywords
Cite
@article{arxiv.0704.0218,
title = {On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases},
author = {Yuri Pritykin},
journal= {arXiv preprint arXiv:0704.0218},
year = {2007}
}
Comments
9 pages. To be presented on 11th International Conference on Developments in Language Theory (DLT'2007), Turku, Finland, July 2007.