Abstract
We show that the hierarchy of classes of languages accepted by finite multi-head automata with oblivious head movements that receive polynomial advice strings collapses to the fifth level. A characterization of nondeterministic logarithmic space with polynomial advice is simplified. In the presence of polynomial advice, the question whether deterministic and nondeterministic logarithmic space are equivalent can be reduced to the question whether simple nondeterministic automata can be simulated deterministically. Polynomial time can be characterized by a one-head device.
For automata without advice we prove that multi-head counter automata, stack automata, and on-erasing stack automata do not lose power by the restriction to oblivious head movements.
Preview
Unable to display preview. Download preview PDF.
References
J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin-Heidelberg-New York, 1988.
S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the Association for Computing Machinery, 18:4–18, 1971.
J. Hartmanis. On non-determinancy in simple computing devices. Acta Informatica, 1:336–344, 1972.
M. Holzer. 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.
R. M. Karp and R. J. Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28:191–209, 1982.
K. N. King. Alternating multihead finite automata. Theoretical Computer Science, 61:149–174, 1988.
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.
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.
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.
I. H. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10:62–76, 1975.
K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its Applications. D. Reidel Publishing Company, Dordrecht, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petersen, H. (1998). The head hierarchy for oblivious finite automata with polynomial advice collapses. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055779
Download citation
DOI: https://doi.org/10.1007/BFb0055779
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive