{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:23Z","timestamp":1725488423622},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666943"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47849-3_28","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T00:45:30Z","timestamp":1186793130000},"page":"404-413","source":"Crossref","is-referenced-by-count":13,"title":["Simulation Problems for One-Counter Machine"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[]},{"given":"1Zden\u011bk","family":"Sawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BFb0055627","volume-title":"Proceedings of CONCUR\u201998","author":"P. Abdulla","year":"1998","unstructured":"Abdulla, P., K. \u010cer\u0101ns (1998). Simulation is decidable for one-counter nets (Extended Abstract.) In Proceedings of CONCUR\u201998, Lecture Notes in Computer Science 1466:253\u2013268."},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-63165-8_210","volume-title":"Proceedings of ICALP\u201997","author":"P. Jan\u010dar","year":"1997","unstructured":"Jan\u010dar, P. (1997). Decidability of bisimilarity for one-counter processes.In Proceedings of ICALP\u201997, Lecture Notes in Computer Science 1256:549\u2013559. (Revised version to appear in The Journal of Information and Computation)."},{"key":"28_CR3","unstructured":"Jan\u010dar, P.,F. Moller (1999). Simulation on one-counter nets via colouring. Uppsala Univ. CSD Report No.159, February 1999. \n                    http:\/\/www.csd.uu.se\/papers\/reports.html"},{"key":"28_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"Proceedings of CONCUR\u201996","author":"F. Moller","year":"1996","unstructured":"Moller, F. (1996). In finite results. Proceedings of CONCUR\u201996, Lecture Notes in Computer Science 1119:195\u2013216."},{"key":"28_CR5","volume-title":"Computation: Finite and In finite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M. (1967). Computation: Finite and In finite Machines. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","volume":"10","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G., M.S. Paterson (1975).Deterministic one-counter automata. Journal of Computer and System Science 10:340\u2013350.","journal-title":"Journal of Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM\u201999: Theory and Practice of Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47849-3_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:23Z","timestamp":1605629663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47849-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540666943"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-47849-3_28","relation":{},"subject":[]}}