Abstract
In this paper we prove that the set of degrees of asynchronously automaton transformations of infinite sequences with a solvable monadic theory forms an initial segment in the set of degrees of asynchronously automaton transformations. We prove a solvability criterion for a monadic theory of a complete sequence.
Similar content being viewed by others
References
G. Reina, “Degrees of Finite-State Transformations,” Kibernetich. Sborn., No. 14, 95–106 (1977).
N. N. Korneeva, “Degrees of Asynchronously Automaton Transformations,” Izv. Vyssh.Uchebn. Zaved. Mat., No. 3, 30–40 (2011) [RussianMathematics (Iz. VUZ) 55 (3), 26–35 (2011)].
V. B. Kudryavtsev, S. V. Aleshin, and A. S. Podkolzin, Introduction to Automata Theory (Nauka, Moscow, 1985) [in Russian].
V. R. Bairasheva, “Degrees of Automaton Transformations of Almost Periodic Superwords and Superwords with Solvability ofMonadic Theory,” Available from VINITI, No. 3103-B89 (Kazan, 1989).
An. A. Muchnik, Yu. L. Pritykin, and A. L. Semenov, “Sequences Close to Periodic,” Usp. Mat. Nauk 64(5), 21–96 (2009).
H. G. Gordon, “Complete Degrees of Finite-State Transformability,” Inform. and Control, 32, 169–187 (1976).
H. G. Gordon, “An Isomorphism of Complete Degrees of Finite-State Transformability,” Inform. and Control, 40, 192–204 (1979).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.N. Korneeva, 2011, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2011, No. 8, pp. 90–93.
Submitted by M.M. Arslanov
About this article
Cite this article
Korneeva, N.N. Automaton transformations and monadic theories of infinite sequences. Russ Math. 55, 78–80 (2011). https://doi.org/10.3103/S1066369X11080123
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X11080123