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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Pritykin, Y. (2007). On almost periodicity criteria for morphic sequences in some particular cases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 361–370). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
