Skip to main content
SpringerLink
Log in

Restricted one-counter machines with undecidable universe problems

Mathematical systems theory volume 13, pages 181–186 (1979)Cite this article

Abstract

We show the undecidability of the universe problem for two restricted classes of nondeterministic one-counter machines. These classes are among the simplest known for which the universe problem can be shown unsolvable.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

References

  1. B. Baker and R. Book, Reversal-bounded multipushdown machines,Journal of Computer and System Sciences, 8, 315–332 (1974).

    Google Scholar 

  2. P. C. Fischer and A. L. Rosenberg, Multitape one-way nonwriting automata,Journal of Computer and System Sciences, 2, 88–101 (1968).

    Google Scholar 

  3. S. A. Greibach, An infinite hierarchy of context-free languages,Journal of the Association for Computing Machinery, 16, 91–106 (1969).

    Google Scholar 

  4. T. V. Griffiths, The unsolvability of the equivalence problem forε-free nondeterministic generalized machines,Journal of the Association for Computing Machinery, 15, 409–413 (1968).

    Google Scholar 

  5. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison Wesley, Reading Massachusetts, 1969.

  6. O. H. Ibarra, Reversal-bounded multicounter machines and their decision problems,Journal of the Association for Computing Machinery, 25, 116–133 (1978).

    Google Scholar 

  7. O. H. Ibarra, The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications,Proceedings of the Eighteenth Annual Symposium on Foundations of Computer Science, 74–81 (1977). Also, inSIAM Journal on Computing, 7, 524–532 (1978).

  8. C. M. Kintala and P. C. Fischer, Computations with a restricted number of nondeterministic steps,Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, 178–185 (1977).

  9. L. Valiant, The equivalence problem for deterministic finite-turn pushdown automata,Information and Control, 25, 123–133 (1974).

    Google Scholar 

  10. L. Valiant and M. Paterson, Deterministic one-counter automata,Journal of Computer and System Sciences, 10, 340–350 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 55455, Minneapolis, Minnesota, USA

    Oscar H. Ibarra

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by National Science Foundation Grants DCR75-17090 and MCS78-01736.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ibarra, O.H. Restricted one-counter machines with undecidable universe problems. Math. Systems Theory 13, 181–186 (1979). https://doi.org/10.1007/BF01744294

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

search

Navigation