Skip to main content
SpringerLink
Log in

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

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1997 (MFCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1295))

Abstract

We develop a framework on multi-head finite automata that allows us to study the relation of parallel logarithmic time and sequential logarithmic space in a uniform and nonuniform setting in more detail. In both settings it turns out that NC1 requires data-independent computations—the movement of the input-heads only depends on the length of the input—whereas logarithmic space is caught with data dependent computations on multi-head finite state machines. This shed new light on the question whether these two classes coincide or not.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences, 38:150–164, 1989.

    Article  Google Scholar 

  3. D. A. M. Barrington, N. Immerman, and H.Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274–306, 1990.

    Article  Google Scholar 

  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.

    Google Scholar 

  5. J. Hartmanis. On non-determinancy in simple computing devices. Acta Informatica, 1:336–344, 1972.

    Article  Google Scholar 

  6. R. M. Karp and R. J. Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28:191–209, 1982.

    Google Scholar 

  7. S. Lindell. A constant-space sequential model of computation for first-order logic. Unpublished, 1995.

    Google Scholar 

  8. C. Meinel. Polynomial size ω-branching programs and their computational power. Information and Computation, 85(2):163–182, April 1990.

    Article  Google Scholar 

  9. B. Monien. Two-way multihead automata over a one-letter alphabet. R.A.I.R.O Informatique theòrique / Theoretical Informatics, 14(l):67–82, 1980.

    Google Scholar 

  10. P. Pudlák and S. Žak. Space complexity of computations. Preprint, Charles University Prague, 1983.

    Google Scholar 

  11. W. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–338, 1981.

    Article  Google Scholar 

  12. I. H. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10:62–76, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Markus Holzer

Authors
  1. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holzer, M. (1997). Multi-head finite automata: Data-independent versus data-dependent computations. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029973

Download citation

  • DOI: https://doi.org/10.1007/BFb0029973

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63437-9

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation