Skip to main content
SpringerLink
Log in

Multicounter automata with sublogarithmic reversal bounds

  • Conference paper
  • First Online:
STACS 93 (STACS 1993)

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

Included in the following conference series:

  • 130 Accesses

Abstract

No two-way nondeterministic multicounter automaton has reversal cost lying between O(1) and o(√log) and no two-way deterministic multicounter automaton has reversal cost lying between O(1) and o(log/loglog). Reversals are counted not only on the counter tapes but also on the input tape.

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. B. S. Baker and R. V. Book. Reversal-bounded multipushdown machines. Journal of Computer and Systems Sciences, 8:315–322, 1974.

    Google Scholar 

  2. T.-H. Chan. Reversal complexity of counter machines. In Proc 13. Ann. ACM Symp. on Theory of Computing, pages 146–157, Milwaukee, Wisconsin, 1981.

    Google Scholar 

  3. T.-H. Chan. Pushdown automata with reversalbounded counters. Journal of Computer and Systems Sciences, 37:269–291, 1988.

    Google Scholar 

  4. J. Chen and C. Yap. Reversal complexity. In Proc. 2nd Structure in Complexity Theory, pages 14–19, 1987.

    Google Scholar 

  5. P. Duris and Z. Galil. On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Information and Control, 54:217–227, 1982.

    Google Scholar 

  6. R. Gengler. Multicounter automata with sublogrithmic reversal bounds. research report 8585CS, Institut für Informatik der Universität Bonn, Römerstr. 164 D-W5300 Bonn 1, Germany, 1992.

    Google Scholar 

  7. E. M. Gurari and O.H. Ibarra. The complexity of decision problems for finiteturn multicounter machines. Journal of Computer and Systems Sciences, 22:220–229, 1981.

    Google Scholar 

  8. O. H. Ibarra. A note on semilinear sets and bounded-reversal multihead pushdown automata. Information Processing Letters, 3:25–28, 1974.

    Google Scholar 

  9. O. H. Ibarra. Bounded multicounter machines and their decision problem. J. Assoc. Comput. Mach., 25:116–133, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I, Universität Bonn, Römerstrasse 164, D-5300, Bonn 1

    Romain Gengler

Authors
  1. Romain Gengler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gengler, R. (1993). Multicounter automata with sublogarithmic reversal bounds. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation