Advertisement

An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines

  • Rodney R. Howell
  • Louis E. Rosier
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 233)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Baker, B., and Book, R., Reversal-Bounded Multipushdown Machines, Journal of Computer and System Sciences 8 (1974), 315–332.Google Scholar
  2. [2]
    Brand, D., and Zafiropulo, P., On Communicating Finite-State Machines, Journal of the ACM 30, 2 (Apr 1983), 323–342.Google Scholar
  3. [3]
    Fisher, P., Turning Machines with Restricted Memory Access, Information and Control 9, 4 (1966), 364–379.Google Scholar
  4. [4]
    Galil, Z., Hierarchies of Complete Problems, Acta Informatica 6 (1976), 77–88.Google Scholar
  5. [5]
    Garey, M., and Johnson, D., Computers and Intractability: A Guide to the Theory of NP-Completeness, (W. H. Freeman and Company, San Francisco, 1979).Google Scholar
  6. [6]
    Ginsburg, S., and Greibach, S., Deterministic Context-Free Languages, Information and Control 9 (1966), 620–648.Google Scholar
  7. [7]
    Gouda, M., Gurari, E., Lai, T., and Rosier, L., On Deadlock Detection in Systems of Communicating Finite State Machines, Rep. TR-84-11, (University of Texas at Austin, 1984). Revised Apr. 1985.Google Scholar
  8. [8]
    Griebach, S., An Infinite Hierarchy of Context-Free Languages, Journal of the ACM 16 (1969), 91–106.Google Scholar
  9. [9]
    Gurari, E., Transducers with Decidable Equivalence Problem, Rep. TR-CS-79-4, (University of Wisconsin-Milwaukee, 1979). Revised 1982.Google Scholar
  10. [10]
    Gurari, E., and Ibarra, O., The Complexity of Decision Problems for Finite-Turn Multicounter Machines, Journal of Computer and System Sciences 22, 2 (Apr 1981), 220–229.Google Scholar
  11. [11]
    Hopcroft, J. and Ullman, J., Introduction to Automata Theory, Languages, and Computation, (Addison-Wesley, Reading, Mass., 1979).Google Scholar
  12. [12]
    Howell, R., and Rosier, L., An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines, Rep. TR-85-16, (University of Texas at Austin, 1985).Google Scholar
  13. [13]
    Ibarra, O., Reversal-Bounded Multicounter Machines and their Decision Problems, Journal of the ACM 25 (1978), 116–133.Google Scholar
  14. [14]
    Ibarra, O., and Rosier, L., On the Decidability of Equivalence for Deterministic Pushdown Transducers, Information Processing Letters 13, 3 (Dec 1981), 89–93.Google Scholar
  15. [15]
    Jones, N., Space-Bounded Reducibility among Combinatorial Problems, Journal of Computer and System Sciences 11 (1975), 68–85.Google Scholar
  16. [16]
    Minsky, M., Recursive Unsolvability of Post's Problem of ‘Tag’ and Other Topics in the Theory of Turing Machines, Annals of Mathematics 74, 3 (1961), 437–455.Google Scholar
  17. [17]
    Rice, H., Classes of Recursively Enumerable Sets and their Decision Problems, Transactions of the AMS 89 (1953), 25–59.Google Scholar
  18. [18]
    Rosier, L., and Gouda, M., Deciding Progress for a Class of Communicating Finite State Machines, pp. 663–667, Proceedings of the Eighteenth Annual Conference on Information Sciences and Systems, (Princeton, NJ, Mar 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Rodney R. Howell
    • 1
  • Louis E. Rosier
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustin

Personalised recommendations