Abstract
We show that the structure of degrees of finite automaton transformations of prefix decidable superwords does not form the upper semilattice.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Reina, G. “Degrees of Finite-State Transformations”, Kiberneticheskii Sborn., No. 14, 95–106 (1977).
Bairasheva, V. R. “Degrees of Automata Transformations of Almost Periodic Superwords and Superwords with the DecidableMonadic Theory”, Available from VINITI, No. 3103-B89 (Kazan, 1989).
Bairasheva, V. R. “Structure Properties of Automata Transformations”, Soviet Mathematics (Iz. VUZ) 32, No. 7, 54–64 (1988).
Vyalyi, M.N., Rubtsov, A. A. “DecidabilityConditions for Problems AboutAutomata Reading InfiniteWords”, Diskretn. Anal. Issled. Oper. 19, No. 2, 3–18 (2012).
Korneeva, N. N. “Automata Transformations of PrefixDecidable and Decidable by Buchi Superwords”, Russian Mathematics (Iz. VUZ) 60, No. 7, 47–55 (2016).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.N. Korneeva, 2016, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, No. 9, pp. 90–95.
About this article
Cite this article
Korneeva, N.N. The structure of degrees of finite-automaton transformations of prefix decidable superwords. Russ Math. 60, 79–83 (2016). https://doi.org/10.3103/S1066369X16090115
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X16090115