Advertisement

Russian Mathematics

, Volume 60, Issue 9, pp 79–83 | Cite as

The structure of degrees of finite-automaton transformations of prefix decidable superwords

  • N. N. KorneevaEmail author
Article
  • 23 Downloads

Abstract

We show that the structure of degrees of finite automaton transformations of prefix decidable superwords does not form the upper semilattice.

Keywords

finite automaton transformation upper semilattice superword prefix decidability 

References

  1. 1.
    Reina, G. “Degrees of Finite-State Transformations”, Kiberneticheskii Sborn., No. 14, 95–106 (1977).Google Scholar
  2. 2.
    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
  3. 3.
    Bairasheva, V. R. “Structure Properties of Automata Transformations”, Soviet Mathematics (Iz. VUZ) 32, No. 7, 54–64 (1988).MathSciNetzbMATHGoogle Scholar
  4. 4.
    Vyalyi, M.N., Rubtsov, A. A. “DecidabilityConditions for Problems AboutAutomata Reading InfiniteWords”, Diskretn. Anal. Issled. Oper. 19, No. 2, 3–18 (2012).MathSciNetzbMATHGoogle Scholar
  5. 5.
    Korneeva, N. N. “Automata Transformations of PrefixDecidable and Decidable by Buchi Superwords”, Russian Mathematics (Iz. VUZ) 60, No. 7, 47–55 (2016).CrossRefGoogle Scholar

Copyright information

© Allerton Press, Inc. 2016

Authors and Affiliations

  1. 1.Kazan (Volga Region) Federal UniversityKazanRussia

Personalised recommendations