Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata

  • Juraj Hromkovič
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Regular Language Finite Automaton Closure Property Deterministic Finite Automaton Input Tape 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sudborough, I.H., One-Way Multihead Writing Finite Automata, Information and Control, Vol. 30, No. 1, January 1976, 1–20.Google Scholar
  2. 2.
    Ibarra, O.H. and Kim, C.E., On 3-head Versus 2-head Finite Automata, Acta Informatica 4 1975, 193–200.Google Scholar
  3. 3.
    Rosenberg, A.L., On Multihead Finite Automata, IBM J. R. and D., 10, 1966, 388–394.Google Scholar
  4. 4.
    Floyd, R.W., Review 14, 352 of above paper by Rosenberg, Computing Review, 9, 5 May 1968, p. 280.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  1. 1.Department of Theoretical CyberneticsKomensky UniversityBratislavaCzechoslovakia

Personalised recommendations