Skip to main content
SpringerLink
Log in

One-way multihead deterministic finite automata

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

It is shown that the family of languages recognized by one-way k head deterministic finite state automata ℒ(1 DFA(k)) and the family of languages recognized by one-way k head deterministic sensing finite state automata ℒ(1DSeFA(k)) are not closed under concatenation, Kleene star and reversal for k≧2. These results are obtained as consequences of a theorem giving a sufficient condition for a language L in order not to be in ℒ(1DSeFA(k)). Several further results above the classes ℒ(1DFA(k)) and ℒ(1DSeFA(k)) are simple consequences of this theorem.

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

Access this article

Log in via an institution

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

  1. Piatkowski, T.F.: N — head finite state machines. Ph.D. Dissertation, University of Michigan, 1963

  2. Rosenberg, A.L.: On multihead finite automata. IBM J.R. and D. 10, 388–394 (1966)

    Google Scholar 

  3. Rosenberg, A.L.: Nonwriting extensions of finite automata. Ph.D. Dissertation, Harvard University, 1965

  4. Floyd, R.W.: Review 14, 353 of above paper by Rosenberg. Comput. Rev. 9, 280 (1968)

    Google Scholar 

  5. Sudborough, I.H.: One-way multihead writing finite automata. Informat. Control 30, 1–20 (1976)

    Google Scholar 

  6. Yao, A.C., Rivest, R.L.: K + 1 heads are better than K. J. ACM 25, 337–340 (1978)

    Google Scholar 

  7. Ibarra, O.H., Kim, C.E.: On 3-head versus 2-head finite automata. Acta Informat. 4, 173–200 (1975)

    Google Scholar 

  8. Hromkovič, J.: Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata. Proc. 10th. MFCS, Lecture Notes in Computer Science 118, pp. 304–313. Berlin, Heidelberg, New York: Springer, 1981

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Cybernetics, Komensky University, 84215, Bratislava, Czechoslovakia

    J. Hromkovič

Authors
  1. J. Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported as a part of the SPZV. I-5-7/7 grant

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hromkovič, J. One-way multihead deterministic finite automata. Acta Informatica 19, 377–384 (1983). https://doi.org/10.1007/BF00290734

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation