This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Baker, B., and Book, R., Reversal-Bounded Multipushdown Machines, Journal of Computer and System Sciences 8 (1974), 315–332.
Brand, D., and Zafiropulo, P., On Communicating Finite-State Machines, Journal of the ACM 30, 2 (Apr 1983), 323–342.
Fisher, P., Turning Machines with Restricted Memory Access, Information and Control 9, 4 (1966), 364–379.
Galil, Z., Hierarchies of Complete Problems, Acta Informatica 6 (1976), 77–88.
Garey, M., and Johnson, D., Computers and Intractability: A Guide to the Theory of NP-Completeness, (W. H. Freeman and Company, San Francisco, 1979).
Ginsburg, S., and Greibach, S., Deterministic Context-Free Languages, Information and Control 9 (1966), 620–648.
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.
Griebach, S., An Infinite Hierarchy of Context-Free Languages, Journal of the ACM 16 (1969), 91–106.
Gurari, E., Transducers with Decidable Equivalence Problem, Rep. TR-CS-79-4, (University of Wisconsin-Milwaukee, 1979). Revised 1982.
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.
Hopcroft, J. and Ullman, J., Introduction to Automata Theory, Languages, and Computation, (Addison-Wesley, Reading, Mass., 1979).
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).
Ibarra, O., Reversal-Bounded Multicounter Machines and their Decision Problems, Journal of the ACM 25 (1978), 116–133.
Ibarra, O., and Rosier, L., On the Decidability of Equivalence for Deterministic Pushdown Transducers, Information Processing Letters 13, 3 (Dec 1981), 89–93.
Jones, N., Space-Bounded Reducibility among Combinatorial Problems, Journal of Computer and System Sciences 11 (1975), 68–85.
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.
Rice, H., Classes of Recursively Enumerable Sets and their Decision Problems, Transactions of the AMS 89 (1953), 25–59.
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Howell, R.R., Rosier, L.E. (1986). An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016267
Download citation
DOI: https://doi.org/10.1007/BFb0016267
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive