Multi-head finite automata: Data-independent versus data-dependent computations

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

Volumn 1295, Issue , 1997, Pages 299-308

  Holzer, Markus ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATA DEPENDENT; LOGARITHMIC TIME;

FINITE AUTOMATA;

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

References (12)

1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.
2. 1. Journal of Computer and System Sciences, 38:150-164, 1989.
3. 1. Journal of Computer and System Sciences, 41:274-306, 1990.
4. C. Damm and M. Holzer. Automata that take advice. In J. Wiedermann and P. Hájek, editors, Proceedings of the 20th Conference on Mathematical Foundations of Computer Science, number 969 in LNCS, pages 149-158, Prague, Czech Republic, August 1995. Springer.
5. J. Hartmanis. On non-determinancy in simple computing devices. Acta Informat-ica, 1:336-344, 1972.
6. R. M. Karp and R. J. Lipton. Turing machines that take advice. L’Enseignement Mathématique, 28:191-209, 1982.
7. S. Lindell. A constant-space sequential model of computation for first-order logic. Unpublished, 1995.
8. C. Meinel. Polynomial size ω-branching programs and their computational power. Information and Computation, 85(2):163-182, April 1990.
9. B. Monien. Two-way multihead automata over a one-letter alphabet. R.A.I.R.O Informatíque theòrique/Theoretical Informatics, 14(1):67-82, 1980.
10. P. Pudlák and S. Žak. Space complexity of computations. Preprint, Charles University Prague, 1983.
11. W. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365-338, 1981.
12. I. H. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10:62-76, 1975.