Skip to main content
SpringerLink
Log in

The equivalence of pebbles and sensing heads for finite automata

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

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

Included in the following conference series:

Abstract

It is shown that deterministic and nondeterministic finite automata equipped with k pebbles are equivalent in recognition power to corresponding automata with k sensing heads. Some other simulations are obtained.

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. J.-C. Birget. Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations. Journal of Computer and System Sciences, 45:154–179, 1992.

    Article  Google Scholar 

  2. M. Blum and C. Hewitt. Automata on a 2-dimensional tape. In Proceedings of the 8th Annual Symposium on Switching and Automata Theory, Austin, 1967, pages 155–160, 1967.

    Google Scholar 

  3. J. H. Chang, O. H. Marra, M. A. Palis, and B. Ravikumar. On pebble automata. Theoretical Computer Science, 44:111–121, 1986.

    Article  Google Scholar 

  4. P. Ďuriš and Z. Galil. Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Theoretical Computer Science, 21:39–53, 1982.

    Article  Google Scholar 

  5. P. Ďuriš and Z. Galil. Sensing versus nonsensing automata. In Z. Fülöp and F. Gécseg, editors, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP), Szeged, 1995, number 944 in Lecture Notes in Computer Science, pages 455–463, Berlin-Heidelberg-New York, 1995. Springer.

    Google Scholar 

  6. N. Globerman and D. Harel. Complexity results for two-way and multi-pebble automata and their logics, Theoretical Computer Science, 169:161–184, 1996.

    Article  Google Scholar 

  7. J. Hartmanis. On non-determinancy in simple computing devices. Acta Informatica, 1:336–344, 1972.

    Google Scholar 

  8. O. H. Ibarra, T. Jiang, N. Tran, and H. Wang. On the equivalence of two-way pushdown automata and counter machines over bounded languages. International Journal of Foundations of Computer Science, 4:135–146, 1993.

    Article  Google Scholar 

  9. O. H. Ibarra, S. M. Kim, and L. E. Rosier. Some characterizations of multihead finite automata. Information and Control, 67:114–125, 1985.

    Article  Google Scholar 

  10. V. A. Kosmidiadi and S. S. Marchenkov. On multihead automata. Systems Theory Research, 21:124–156, 1971. Translation of Probl. Kib. 21:127-158, 1969, in Russian.

    Google Scholar 

  11. D. L. Kreider and R. W. Ritchie. A basis theorem for a class of two-way automata. Zeitschrift für mathematische Logik and Grundlagen der Mathematik, 12:243–255, 1966.

    Google Scholar 

  12. B. Monien. Two-way multihead automata over a one-letter alphabet. R.A.I.R.O. — Informatique Théorique et Applications, 14:67–82, 1980.

    Google Scholar 

  13. H. Petersen. Automata with sensing heads. In Proceedings of the Third Israel Symposium on the Theory of Computing and Systems, Tel Aviv, 1995, pages 150-157. IEEE Computer Society Press, 1995.

    Google Scholar 

  14. R. W. Ritchie and F. N. Springsteel. Language recognition by marking automata. Information and Control, 20:313–330, 1972.

    Article  Google Scholar 

  15. A. Rosenfeld. Picture Languages. Academic Press, New York, 1979.

    Google Scholar 

  16. W. J. Sakoda and M. Sipser. Nondeterminism and the size of two way finite automata. In Proceedings of the 10th ACM Symposium on Theory of Computing (STOC), San Diego, 1978, pages 275–286, 1978.

    Google Scholar 

  17. J. C. Shepherdson. The reduction of two-way automata to one-way automata. IBM Journal of Research and Development, 3:198–200, 1959.

    Google Scholar 

  18. L. Voelkel. Language recognition by linear bounded and copy programs. In Proceedings of the 2nd Conference on Fundamentals of Computation Theory (FCT), Berlin/Wendisch-Rietz, 1979, pages 491–495, Berlin, 1979. Akademie-Verlag.

    Google Scholar 

  19. K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its Applications. D. Reidel Publishing Company, Dordrecht, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, D-70565, Stuttgart

    Holger Petersen

Authors
  1. Holger Petersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petersen, H. (1997). The equivalence of pebbles and sensing heads for finite automata. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036201

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation