Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On 3-head versus 2-head finite automata

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A direct proof is given that shows that (one-way) 3-head deterministic finite automata are computationally more powerful than 2-head finite automata.

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
$34.99 /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 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

  • Ginsburg, S.: The Mathematical Theory of Context-Free Languages. New York: McGraw-Hill 1966

    Google Scholar 

  • Harrison, M. A., Ibarra, O. H.: Multi-tape and multi-head pushdown automata. Information and Control 13, 433–470 (1968)

    Google Scholar 

  • Rosenberg, A. L.: On multi-head finite automata. IBM J. R and D 10, 388–394 (1966)

    Google Scholar 

  • Sudborough, I. H.: Computation by multi-head finite automata. IEEE Conf. Record of Twelfth Annual Symposium on Switching and Automata Theory, East Lansing (Mich.) 1971, p. 105–113

  • Sudborough, I. H.: Computation by multi-head writing finite automata. Pennsylvania State University, Ph. D. Thesis 1971

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 55455, Minneapolis, Minnesota, USA

    Oscar H. Ibarra & Chul E. Kim

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chul E. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the National Science Foundation Grant GJ-35614.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ibarra, O.H., Kim, C.E. On 3-head versus 2-head finite automata. Acta Informatica 4, 193–200 (1975). https://doi.org/10.1007/BF00288748

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation