The equivalence of pebbles and sensing heads for finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1279, Issue , 1997, Pages 400-410

  Petersen, Holger ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA;

NONDETERMINISTIC FINITE AUTOMATON;

COMPUTATION THEORY;

EID: 84956980376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036201     Document Type: Conference Paper

References (19)

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.
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.
3. J. H. Chang, O. H. Ibarra, M. A. Palis, and B. Ravikumar, On pebble automata. Theoretical Computer Science, 44:111-121, 1986.
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.
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.
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.
7. J. Hartmanis. On non-determinancy in simple computing devices. Acta Information, 1:336-344, 1972.
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.
9. O. H. Ibarra, S. M. Kim, and L. E. Rosier. Some characterizations of multihead finite automata. Information and Control, 67:114-125, 1985.
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.
11. D. L. Kreider and R. W. Ritchie. A basis theorem for a class of two-way automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 12:243-255, 1966.
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.
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 15O-157. IEEE Computer Society Press, 1995.
14. R. W. Ritchie and F. N. Springsteel. Language recognition by marking automata. Information and Control, 20:313-330, 1972.
15. A. Rosenfeld. Picture Languages. Academic Press, New York, 1979.
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.
17. J. C. Shepherdson. The reduction of two-way automata to one-way automata. IBM Journal of Research and Development, 3:198-200, 1959.
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.
19. K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its Applications. D. Reidel Publishing Company, Dordrecht, 1986.