{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:36:54Z","timestamp":1725521814324},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_10","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"103-114","source":"Crossref","is-referenced-by-count":6,"title":["On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Wei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A. Brauer","year":"1942","unstructured":"A. Brauer. On a problem of partitions. Amer. J. Math., 64:299\u2013312, 1942.","journal-title":"Amer. J. Math."},{"key":"10_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Workshop of Logic of Programs","author":"E. M. Clarke","year":"1981","unstructured":"E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop of Logic of Programs, volume 131 of Lecture Notes in Computer Science. Springer, 1981."},{"issue":"2","key":"10_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, April 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Proc. 10th Int. Conf. Computer Aided Verification (CAV\u201998)","author":"H. Comon","year":"1998","unstructured":"H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV\u201998), volume 1427 of Lecture Notes in Computer Science, pages 268\u2013279. Springer, 1998."},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"Proc. 10th Int. Conf. Concurrency Theory (CONCUR\u201999)","author":"H. Comon","year":"1999","unstructured":"H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In Proc. 10th Int. Conf. Concurrency Theory (CONCUR\u201999), volume 1664 of Lecture Notes in Computer Science, pages 242\u2013257. Springer, 1999."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-44679-6_59","volume-title":"Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON\u201901)","author":"Z. Dang","year":"2001","unstructured":"Zhe Dang, O. H. Ibarra, and R. A. Kemmerer. Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON\u201901), volume 2108 of Lecture Notes in Computer Science, pages 529\u2013539. Springer, 2001."},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/3-540-46541-3_29","volume-title":"InProc. 17thAnn. Symp. Theoretical Aspects of Computer Science (STACS\u20192000), Lille, France, Feb. 2000","author":"A. Finkel","year":"2000","unstructured":"A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. InProc. 17thAnn. Symp. Theoretical Aspects of Computer Science (STACS\u20192000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346\u2013357. Springer, 2000."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific J. of Mathematics, 16:285\u2013296, 1966.","journal-title":"Pacific J. of Mathematics"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E. M. Gurari","year":"1981","unstructured":"E. M. Gurari and O. H. Ibarra. The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences, 22:220\u2013229, 1981.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/322326.322340","volume":"29","author":"E. M. Gurari","year":"1982","unstructured":"E. M. Gurari and O. H. Ibarra. Two-way counter machines and Diophantine equations. Journal of the ACM, 29(3):863\u2013873, 1982.","journal-title":"Journal of the ACM"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. H. Ibarra","year":"1978","unstructured":"O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116\u2013133, January 1978.","journal-title":"Journal of the ACM"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"24","author":"O. H. Ibarra","year":"1995","unstructured":"O. H. Ibarra, T. Jiang, N. Tran, and H. Wang. New decidability results concerning two-way counter machines. SIAM J. Comput., 24:123\u2013137, 1995.","journal-title":"SIAM J. Comput."},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44612-5_38","volume-title":"Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000)","author":"O. H. Ibarra","year":"2000","unstructured":"O. H. Ibarra, J. Su, Zhe Dang, T. Bultan, and R. A. Kemmerer. Counter machines: decidable properties and applications to verification problems. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 426\u2013435. Springer-Verlag, 2000."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01204720","volume":"12","author":"R. Kannan","year":"1992","unstructured":"R. Kannan. Lattice translates of a polytope and the Frobenius problem. Combinatorica, 12:161\u2013177, 1992.","journal-title":"Combinatorica"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1998219","volume":"235","author":"L. Lipshitz","year":"1978","unstructured":"L. Lipshitz. The Diophantine problem for addition and divisibility. Transactions of AMS, 235:271\u2013283, 1978.","journal-title":"Transactions of AMS"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1002\/mana.19580180112","volume":"18","author":"K. Mahler","year":"1958","unstructured":"K. Mahler. On the Chinese remainder theorem. Math. Nachr., 18:120\u2013122, 1958.","journal-title":"Math. Nachr."},{"key":"10_CR18","unstructured":"Y. V. Matiyasevich. Hilbert\u2019s Tenth Problem. MIT Press, 1993."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"M. Minsky. Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math., 74:437\u2013455, 1961.","journal-title":"Ann. of Math."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01300131","volume":"16","author":"J. L. Ramirez-Alfonsin","year":"1996","unstructured":"J. L. Ramirez-Alfonsin. Complexity of the Frobenius problem. Combinatorica, 16:143\u2013147, 1996.","journal-title":"Combinatorica"},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. P. Sistla","year":"1983","unstructured":"A. P. Sistla and E. M. Clarke. Complexity of propositional temporal logics. Journal of ACM, 32(3):733\u2013749, 1983.","journal-title":"Journal of ACM"},{"key":"10_CR22","unstructured":"M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, LICS\u201986, Cambridge, MA, USA, 16-18 June 1986, pages 332\u2013344, Washington, DC, 1986. IEEE Computer Society Press."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:19:12Z","timestamp":1551064752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}