Skip to main content
Conference Proceedings

Sensing versus nonsensing automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 944 455-463
DOI: 10.1007/3-540-60084-1_96
2Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

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 oid open problem [2]. The proof uses two new pumping lemmas.

Cite

CITATION STYLE

APA

Ďuriš, P., & Galil, Z. (1995). Sensing versus nonsensing automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 944, pp. 455–463). Springer Verlag. https://doi.org/10.1007/3-540-60084-1_96

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free