Skip to main content
SpringerLink
Log in

Hierarchy of reversal and zerotesting bounded multicounter machines

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

Abstract

We consider one-way partially blind multicounter machines introduced by Greibach [2], and one-way multicounter machines. We study the reversal and zerotesting bounded versions of these machines, where for the input words of the length n the number of reversals or zerotests is bounded by a function f(n). It is established that time, nondeterminism, and counters, as the resources, cannot compensate for a substantial decrease of the number of reversals allowed. Several hierarchy results are consequences of this fact.

Another group of results involves the hierarchy results according to zerotest number bound, and relates the reversal complexity and the zerotest complexity.

This work was supported in the part by the grant SPZV 1-5-7/7.

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. Ginsburg, S.: Algebraic and Automata — Theoretic Properties of Formal Languages. North-Holland Publ. Comp., 1975

    Google Scholar 

  2. Greibach, S.A.: Remarks on Blind and Partially Blind One-Way Multicounter Machines. TCS 7, 311–324 (1978)

    Google Scholar 

  3. Greibach, S.A.: The Hardest Context-free Language. SIAM J. of Comp. 2, 304–310 (1973)

    Google Scholar 

  4. Greibach, S.A.: Remarks on the Complexity of Nondeterministic Counter Languages. TCS 1, 269–288 (1976)

    Google Scholar 

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

    Google Scholar 

  6. Ibarra, O.H.: Reversal — Bounded Multicounter Machines and Their Decision Problems. JACM 25, 116–133 (1978)

    Google Scholar 

  7. Jantzen, M.: On Zerotesting — Bounded Multicounter Machines. Proc. of 4th GJ Conference, pp. 158–169, Berlin, Heidelberg, New York: Springer, 1979.

    Google Scholar 

  8. Chan, T.: Reversal Complexity of Counter Machines. Proc. of Annual Symposium on Theory of Computing 1981, 146–157

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Cybernetics, Comenius University, 842 15, Bratislava, Czechoslovakia

    J. Hromkovič

Authors
  1. J. Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hromkovič, J. (1984). Hierarchy of reversal and zerotesting bounded multicounter machines. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030312

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation