Skip to main content
SpringerLink
Log in

Sensing versus nonsensing automata

  • Automata and Formal Languages III
  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

It is shown that one way deterministic sensing two head finite automata are more powerful than one way deterministic two head finite automata. This result solves a 14 year old open problem [2]. The proof uses two new pumping lemmas.

This work was partially supported by NSF grant CCR-93-16209 and CISE Institutional Infrastructure Grant CDA-90-24735, and by EC cooperation Action IC 1000, ALTEC

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O.H. Ibarra, A note on semilinear sets and bounded-reversal multihead pushdown automata, Inform. Process. Lett. 3 (1974) 25–28.

    Google Scholar 

  2. K. Inoue, I. Takanami, A. Nakamura and T. Ae, One-way simple multihead finite automata, Theoret. Comput. Sci. 9 (1979) 311–328.

    Google Scholar 

  3. T. Jiang and M. Li, κ one-way heads cannot do string-matching, Proceedings 25th ACM Symp. on Theory of Computing, (1993) 62–70.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Comenius University, 842 15, Bratislava, Slovakia

    Pavol ďuriš

  2. Department of Computer Science, Columbia University, 10027, New York, NY

    Zvi Galil

  3. Tel-Aviv University, Isreal

    Zvi Galil

Authors
  1. Pavol ďuriš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zvi Galil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

ďuriš, P., Galil, Z. (1995). Sensing versus nonsensing automata. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation