Abstract
We introduce a class of eventually almost periodic sequences where some suffix is almost periodic (i.e., uniformly recurrent). The class of generalized almost periodic sequences includes the class of eventually almost periodic sequences, and we prove this inclusion to be strict. We also prove that the class of eventually almost periodic sequences is closed under finite automata mappings and finite transductions. Moreover, we obtain an effective form of this result. In conclusion we consider some algorithmic questions related to the almost periodicity.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J.-P. Allouche and J. Shallit, “The Ubiquitous Prouhet-Thue-Morse Sequence,” in: Sequences and Their Applications (Proceedings of SETA’98, Springer Verlag, 1999), pp. 1–16.
J. Cassaigne, “Recurrence in Infinite Words,” in Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science (STACS 2001) (Springer Verlag, 2001), pp. 1–11.
K. Jacobs, Maschinenerzeugte 0-1-Folgen (Selecta Mathematica II. Springer Verlag: Berlin, Heidelberg, New York, 1970).
M. Morse and G. A. Hedlund, “Symbolic Dynamics,” American Journal of Mathematics 60, 815–866 (1938).
M. Morse and G. A. Hedlund, “Symbolic Dynamics II: Sturmian Rrajectories,” American Journal of Mathematics 62, 1–42 (1940).
M. Keane, “Generalized Morse sequences,” Z.Wahrscheinlichkeitstheorie verw. Geb. 10, 335–353 (1968).
An. Muchnik, A. Semenov, and M. Ushakov, “Almost Periodic Sequences,” Theoretical Computer Science 304, 1–33, (2003).
Yu. L. Pritykin, “Finite-Automaton Transformations of Strictly Almost-Periodic Sequences,” Mat. Zametki 80(5), 751–756, (2006).
Yu. L. Pritykin, “Finite Automata Mappings of Strongly Almost Periodic Sequences and Algorithmic Undecidability,” in: Proceedings of XXVIII Conference of Young Scientists (Moscow State University, Faculty of Mechanics and Mathematics, 2006), pp. 177–181.
M. A. Raskin, “On the Estimate of the Regulator for Automaton Mapping of Almost Periodic Sequence,” in: Proceedings of XXVIII Conference of Young Scientists (Moscow State University, Faculty of Mechanics and Mathematics, 2006), pp. 181–185.
A. L. Semenov, “On Certain Extensions of the Arithmetic of Addition of Natural Numbers,” Izv. Akad. Nauk, Ser. Matem. 15, pp. 401–418 (1980).
A. L. Semenov, “Logical Theories ofOne-Place Functions on the Set of Natural Numbers,” Izv. Akad. Nauk, Ser. Matem. 22, 587–618 (1983).
A. Thue, “Über unendliche Zeichenreihen,” Norske vid. Selsk. Skr.Mat. Nat. Kl. 7, 1–22 (1906).
A. Weber, “On the Valuedness of Finite Transducers,” Acta Informatica 27, 749–780 (1989).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.L. Pritykin, 2010, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, No. 1, pp. 74–87.
About this article
Cite this article
Pritykin, Y.L. Almost periodicity, finite automata mappings, and related effectiveness issues. Russ Math. 54, 59–69 (2010). https://doi.org/10.3103/S1066369X1001007X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X1001007X