Skip to main content
Springer Nature Link
Log in

Complete system of equivalent transformations for two-tape automata with disjoint loops

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Two-tape automata are considered such that their transition diagrams do not have intersecting loops. A system of equivalent transformations is described for these automata, and its completeness with respect to the set of the transformations is proved.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (China (P.R.))

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Rabin, M.O. and Scott, D., Finite Automata and Their Decision Problems,IBM J. Res. Dev., 1959, vol. 3, no. 2, pp. 114–125.

    Article  MathSciNet  Google Scholar 

  2. Bird, R., The Equivalence Problem for Deterministic Two-Tape Automata,J. Comput. Syst. Sci., 1973, vol. 7, no. 4, pp. 218–236.

    MATH  MathSciNet  Google Scholar 

  3. Harju, T. and Kazhumaki, J., The Equivalence of Multi-Tape Finite Automata,Theor. Comput. Sci., 1991, vol. 78, no. 2, pp. 347–355.

    Article  MATH  Google Scholar 

  4. Kinber, E.B., On a Class of Multitape Automata with the Solvable Equivalence Problem,Programmirovanie, 1983, no. 3, pp. 3–16.

    Google Scholar 

  5. Lewis, H.R., A New Decidable Problem with Application,Proc. 18 Ann. Symp. on Foundations of Comput. Sci., 1979, pp. 62–73.

  6. Khachaturyan, V.E., Homogeneous Logical Graphs, inPrikladnaya matematika (Applied Mathematics), Yerevan: Yerevan Gos. Univ., 1981, pp. 67–80.

    Google Scholar 

  7. Podlovchenko, R.I. and Airapetyan, M.T., On the Construction of Complete Systems of Equivalent Transformations of Program Schemes,Programmirovanie, 1996, no. 1, pp. 3–29.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Research Center, Moscow State University, Vorob'evy gory, 119899, Moscow, Russia

    R. I. Podlovchenko

  2. Belgorod

    V. E. Khachatryan & Yu. G. Chashin

Authors
  1. R. I. Podlovchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. E. Khachatryan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu. G. Chashin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Podlovchenko, R.I., Khachatryan, V.E. & Chashin, Y.G. Complete system of equivalent transformations for two-tape automata with disjoint loops. Program Comput Soft 26, 237–248 (2000). https://doi.org/10.1007/BF02759317

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02759317

Keywords

Search

Navigation