Skip to main content
SpringerLink
Log in

Reversal complexity of multicounter and multihead machines

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

  • 127 Accesses

Abstract

It is proved that the family of languages recognized by one-way real-time nondeterministic multicounter machines with constant number of counter reversals is not closed under complementation.

The best known lower bound Ω(n1/3/log2n) on the complexity measure REVERSALS·SPACE·PARALLELISM of multihead alternating machines is improved to Ω(n1/2/log2n). Several strongest lower bounds for different complexity measures are direct consequences of this result.

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. Chan, T.: Reversal complexity of counter machines. Proc. IEEE STOC 1981, IEEE, New York, pp.146–157.

    Google Scholar 

  2. Ďuriš, P.-Galil, Z.: On reversal bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Inform. Control 54, 3, 1982, 217–227.

    Google Scholar 

  3. Ďuriš, P.-Galil, Z.: A time-space tradeoff for language recognition. Math. Systems Theory 17, 1984, 3–12.

    Google Scholar 

  4. Ginsburg, S.: Algebraic and Automata — Theoretic Properties of Formal Languages. North-Holland Publ. Comp., Amsterdam 1975.

    Google Scholar 

  5. Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7, 1978, 311–324.

    Google Scholar 

  6. Hack, M.: Petri Net Languages, Computation Structures. Group Memo 124, Project MAC, MIT, 1975.

    Google Scholar 

  7. Hromkovič, J.: Hierarchy of reversal and zerotesting bounded multicounter machines. Proc. 11th MFCS'84 (M.P.Chytil, V.Koubek eds.), Lect. Notes in Comp. Science 176, Springer-Verlag 1984, 312–321.

    Google Scholar 

  8. Hromkovič, J.: Hierarchy of reversal bounded one-way multicounter machines. Kybernetika 22, 2, 1986, 200–206.

    Google Scholar 

  9. Hromkovič, J.: Tradeoffs for language recognition on parallel computing models. Proc. 13th ICALP'86 (L.Kott ed.), Lect. Notes in Comp. Science 226, Springer-Verlag 1986, pp. 157–166.

    Google Scholar 

  10. Hromkovič, J.: On the power of alternation in automata theory. J. Comput. System Sciences 31, 1, 1985, 28–39.

    Google Scholar 

  11. Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. of ACM 25, 1978, 116–133.

    Google Scholar 

  12. Rosenberg, A.L.: On multihead finite automata. IBM J. R. and D. 10, 1966, 388–394.

    Google Scholar 

  13. Wagner, K. — Wechsung, G.: Computational Complexity. Mathematische Monographien, Band 19, VEB Deutscher Verlag der Wissenschaften, Berlin 1986.

    Google Scholar 

  14. Dymond, P.W. — Cook, S.A.: Hardware complexity and parallel computations. Proc. 21th Annual IEEE FOCS 1980, pp. 360–372.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Theoretical Cybernetics and Mathematical Informatics, Comenius University, 842 15, Bratislava, Czechoslovakia

    Juraj Hromkovič

Authors
  1. Juraj Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hromkovič, J. (1987). Reversal complexity of multicounter and multihead machines. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039603

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation