Skip to main content
SpringerLink
Log in

Automata transformations of prefix decidable and decidable by Buchi superwords

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We show that the set of prefix decidable superwords is closed under finite automata and asynchronous automata transformations. We prove that structures of degrees of finite automata and asynchronous automata transformations contain an atom which consists of prefix decidable superwords with undecidable monadic theory (or undecidable by Buchi). Also we prove that the structure of degrees of asynchronous automata transformations contains an atom which consists of superwords with decidable monadic theory (decidable by Buchi).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Semenov, A. L. “Logical Theories of Monadic Functions on Natural Series”, Izv. AN SSSR. Ser. Matem. 47, No. 3, 623–658 (1983) [in Russian].

    Google Scholar 

  2. Muchnik, An., Semenov, A., Ushakov, M. “Almost Periodic Sequences”, Theoret. Comput. Sci. 304, 1–33 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  3. Muchnik, An. A., Pritykin Yu. L., Semenov, A. L. “Sequences Close to Periodic”, Russ. Math. Surv. 64, No. 5, 805–871 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  4. Pritykin, Yu. L. “Finite-Automaton Transformations of Strictly Almost-Periodic Sequences”, Math. Notes 80, No. 5, 710–714 (2006).

    Article  MathSciNet  MATH  Google Scholar 

  5. Pritykin, Yu. L. “Almost Periodicity, Finite Automata Mappings, and Related Effectiveness Issues”, Russian Mathematucs (Iz. VUZ) 54, No. 1, 74–87 (2010).

    MathSciNet  MATH  Google Scholar 

  6. Dekking, F.M. “Iteration ofMaps by an Automaton”, DiscreteMath. 126, Nos. 1–3, 81–86 (1994).

    MathSciNet  MATH  Google Scholar 

  7. Cobham, A. “Uniform Tag Sequences”, Math. Systems Theory 6, Nos. 1–3, 164–192 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  8. Vyalyi, M. N., Rubtsov, A. A. “Decidability Conditions for Problems About Automata Reading Infinite Words”, Diskretn. Anal. Issled. Oper. 19, No. 2, 3–18 (2012) [in Russian].

    MathSciNet  MATH  Google Scholar 

  9. Buchi, J. R. “On a Decision Method in Restricted Second Order Arithmetic”, in Proceedings of 1960 International Congress ‘Logic, Methodology and Philosophy of Sci.’ (Stanford Univ. Press, Stanford, CA, 1962), 1–11.

    Google Scholar 

  10. Kudryavstev, V. B., Alyoshin S.V., Podkolozin, A. S. Introduction to Theory ofAutomata (Nauka,Moscow, 1985) [in Russian].

    Google Scholar 

  11. 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).

    Google Scholar 

  12. Korneeva, N. N. “Automaton Transformations and Monadic Theories of Infinite Sequences”, Russian Mathematics (Iz. VUZ) 55, No. 8, 78–80 (2011)

    MathSciNet  MATH  Google Scholar 

  13. Korneeva, N. N. “Monadic Theories of Infnite Sequences under Asynchronous Automata Transformations”, Uchen. Zap. Kazansk. Univ. Ser. Fiz.-Matem. Nauki 154. No. 2, 117–124 (2012) [In Russian].

    MathSciNet  Google Scholar 

  14. Reina G. “Degrees of Finite-State Transformations”, Kibern. Sborn., No. 14, 95–106 (1977).

    Google Scholar 

  15. Korneeva, N. N. “Degrees of Asynchronously Automaton Transformations”, Russian Mathematics (Iz. VUZ) 55, No. 3, 26–35 (2011).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan (Volga Region) Federal University, ul. Kremlyovskaya 18, Kazan, 420008, Russia

    N. N. Korneeva

Authors
  1. N. N. Korneeva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. N. Korneeva.

Additional information

Original Russian Text © N.N. Korneeva, 2016, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, No. 7, pp. 55–65.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Korneeva, N.N. Automata transformations of prefix decidable and decidable by Buchi superwords. Russ Math. 60, 47–55 (2016). https://doi.org/10.3103/S1066369X16070070

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X16070070

Keywords

Search

Navigation