The head hierarchy for oblivious finite automata with polynomial advice collapses

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

Volumn 1450 LNCS, Issue , 1998, Pages 296-304

  Petersen, Holger ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; POLYNOMIAL APPROXIMATION;

COUNTER AUTOMATA; HEAD MOVEMENTS; NONDETERMINISTIC AUTOMATA; POLYNOMIAL-TIME;

POLYNOMIAL APPROXIMATION; POLYNOMIALS;

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

References (12)

1. J. L. Balcázar, J. Díaz, and J. Gabarro. Structural Complexity I, Volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin-Heidelberg-New York, 1988.
2. S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the Association for Computing Machinery, 18:4-18, 1971.
3. J. Hartmanis. On non-determinancy in simple computing devices. Acta Informat-ica, 1:336-344, 1972.
4. M. Hölzer. Multi-head finite automata: Data-independent versus data-dependent computations. In I. Prívara and P. Ružička, editors, Proceedings of the 22nd Symposium on Mathematical Foundations of Computer Science (MFCS), Bratislava, 1997, number 1295 in Lecture Notes in Computer Science, pages 299-308. Springer, 1997.
5. R. M. Karp and R. J. Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28:191-209, 1982.
6. K. N. King. Alternating multihead finite automata. Theoretical Computer Science, 61:149-174, 1988.
7. V. A. Kosmidiadi and S. S. Marchenkov. On multihead automata. Systems Theory Research, 21:124-156, 1971
8. Translation of Probl. Kib. 21:127-158, 1969, in Russian.
9. R. E. Ladner. The Circuit Value Problem is log space complete for P. SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 7:18-20, 1975.
10. B. Monien. Characterizations of time-bounded computations by limited primitive recursion. In Proceedings of the 2nd International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, 1974, number 14 in Lecture Notes in Computer Science, pages 280-293. Springer, 1974.
11. I. H. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10:62-76, 1975.
12. K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its Applications. D. Reidel Publishing Company, Dordrecht, 1986.