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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allouche, J.-P., Shallit, J.: Automatic Sequences. Cambridge University Press, Cambridge (2003)
Carton, O., Thomas, W.: The Monadic Theory of Morphic Infinite Words and Generalizations. Information and Computation 176, 51–65 (2002)
Cobham, A.: Uniform tag sequences. Math. Systems Theory 6, 164–192 (1972)
Kolmogorov Seminar, http://lpcs.math.msu.su/kolmogorovseminar/eng/
Maes, A.: More on morphisms and almost-periodicity. Theoretical Computer Science 231(2), 205–215 (2000)
Morse, M., Hedlund, G.A.: Symbolic dynamics. American Journal of Mathematics 60, 815–866 (1938)
Muchnik, A., Semenov, M., Ushakov, M.: Almost periodic sequences. Theoretical Computer Science 304, 1–33 (2003)
Pritykin, Y.L.: Finite-Automaton Transformations of Strictly Almost-Periodic Sequences. Mathematical Notes 80(5), 710–714 (2006)
Pritykin, Y.: Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues. In: Proceedings of WoWA 2006, St. Petersburg, Russia (satellite to CSR 2006). Izvestia VUZov. Mathematics (to appear, 2007)
Semenov, A.L.: On certain extensions of the arithmetic of addition of natural numbers. Math. of USSR, Izvestia 15, 401–418 (1980)
Semenov, A.L.: Logical theories of one-place functions on the set of natural numbers. Math. of USSR, Izvestia 22, 587–618 (1983)
Weisstein, E.W.: Weisstein. Bell Number. From MathWorld — A Wolfram Web Resource, http://mathworld.wolfram.com/BellNumber.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pritykin, Y. (2007). On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-73208-2_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73207-5
Online ISBN: 978-3-540-73208-2
eBook Packages: Computer ScienceComputer Science (R0)