Skip to main content

Another hierarchy defined by multihead finite automata

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

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. Fisher, P.C., Kintala, CH.M.R., Real-time computations with restricted nondeterminism, Math. systems theory 12 /1979/

    Google Scholar 

  2. Janiga, L., Real-time computations of two-way multihead finite automata, Proc of the FCT'79 conference, Akademie-Verlag, Berlin 1979

    Google Scholar 

  3. Hartmanis,J., On non-determinancy in simple computing devices, Acta inf. 1 /1972/

    Google Scholar 

  4. Yao,A.C., Rivest,R.L., k+1 heads are better than k, MIT.

    Google Scholar 

  5. Janiga,L., Nondeterminancy bounded computations of multihead automata, in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janiga, L. (1981). Another hierarchy defined by multihead finite automata. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics