{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:27Z","timestamp":1725455487438},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016267","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"422-430","source":"Crossref","is-referenced-by-count":0,"title":["An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines"],"prefix":"10.1007","author":[{"given":"Rodney R.","family":"Howell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. Baker","year":"1974","unstructured":"Baker, B., and Book, R., Reversal-Bounded Multipushdown Machines, Journal of Computer and System Sciences 8 (1974), 315\u2013332.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"38_CR2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., and Zafiropulo, P., On Communicating Finite-State Machines, Journal of the ACM 30, 2 (Apr 1983), 323\u2013342.","journal-title":"Journal of the ACM"},{"issue":"4","key":"38_CR3","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","volume":"9","author":"P. Fisher","year":"1966","unstructured":"Fisher, P., Turning Machines with Restricted Memory Access, Information and Control 9, 4 (1966), 364\u2013379.","journal-title":"Information and Control"},{"key":"38_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00263744","volume":"6","author":"Z. Galil","year":"1976","unstructured":"Galil, Z., Hierarchies of Complete Problems, Acta Informatica 6 (1976), 77\u201388.","journal-title":"Acta Informatica"},{"key":"38_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., and Johnson, D., Computers and Intractability: A Guide to the Theory of NP-Completeness, (W. H. Freeman and Company, San Francisco, 1979)."},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., and Greibach, S., Deterministic Context-Free Languages, Information and Control 9 (1966), 620\u2013648.","journal-title":"Information and Control"},{"unstructured":"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.","key":"38_CR7"},{"key":"38_CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","volume":"16","author":"S. Griebach","year":"1969","unstructured":"Griebach, S., An Infinite Hierarchy of Context-Free Languages, Journal of the ACM 16 (1969), 91\u2013106.","journal-title":"Journal of the ACM"},{"unstructured":"Gurari, E., Transducers with Decidable Equivalence Problem, Rep. TR-CS-79-4, (University of Wisconsin-Milwaukee, 1979). Revised 1982.","key":"38_CR9"},{"issue":"2","key":"38_CR10","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E. Gurari","year":"1981","unstructured":"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\u2013229.","journal-title":"Journal of Computer and System Sciences"},{"key":"38_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J. and Ullman, J., Introduction to Automata Theory, Languages, and Computation, (Addison-Wesley, Reading, Mass., 1979)."},{"unstructured":"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).","key":"38_CR12"},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. Ibarra","year":"1978","unstructured":"Ibarra, O., Reversal-Bounded Multicounter Machines and their Decision Problems, Journal of the ACM 25 (1978), 116\u2013133.","journal-title":"Journal of the ACM"},{"issue":"3","key":"38_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(81)90116-2","volume":"13","author":"O. Ibarra","year":"1981","unstructured":"Ibarra, O., and Rosier, L., On the Decidability of Equivalence for Deterministic Pushdown Transducers, Information Processing Letters 13, 3 (Dec 1981), 89\u201393.","journal-title":"Information Processing Letters"},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N. Jones","year":"1975","unstructured":"Jones, N., Space-Bounded Reducibility among Combinatorial Problems, Journal of Computer and System Sciences 11 (1975), 68\u201385.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"38_CR16","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M., Recursive Unsolvability of Post's Problem of \u2018Tag\u2019 and Other Topics in the Theory of Turing Machines, Annals of Mathematics 74, 3 (1961), 437\u2013455.","journal-title":"Annals of Mathematics"},{"key":"38_CR17","first-page":"25","volume":"89","author":"H. Rice","year":"1953","unstructured":"Rice, H., Classes of Recursively Enumerable Sets and their Decision Problems, Transactions of the AMS 89 (1953), 25\u201359.","journal-title":"Transactions of the AMS"},{"unstructured":"Rosier, L., and Gouda, M., Deciding Progress for a Class of Communicating Finite State Machines, pp. 663\u2013667, Proceedings of the Eighteenth Annual Conference on Information Sciences and Systems, (Princeton, NJ, Mar 1984).","key":"38_CR18"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016267.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:53Z","timestamp":1607549753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0016267","relation":{},"subject":[]}}