Skip to main content

On multitape automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

  • 135 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rabin, M.O. and Scott, D., Finite Automata and Their Decision Problems. IBM J. Res. Develop., 3 (1959), 114–125.

    Google Scholar 

  2. Luckham, D.C., Park, D.M.R. and Paterson, M.F., On Formalized Computer Programs. JCSS, 4 (1970), 220–249.

    Google Scholar 

  3. Bird, M., The Equivalence Problem for Deterministic Two-Tape Automata. JCSS, 7 (1973), 218–236.

    Google Scholar 

  4. Lewis, H.R., A New Decidable Problem, With Applications. Proc. 18th Annual Symp. on Foundations of Computer Science (1977).

    Google Scholar 

  5. Karp, R.M. and Miller, R.E., Parallel Program Schemata. JCSS, 3 (1969), 147–195.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamasaki, H. (1979). On multitape automata. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics