{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:38Z","timestamp":1760202698217,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_15","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"200-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Insertion Operations on Deterministic Reversal-Bounded Counter Machines"],"prefix":"10.1007","author":[{"given":"Joey","family":"Eremondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"McQuillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"BS Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8(3), 315\u2013332 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2012.04.002","volume":"454","author":"E Chiniforooshan","year":"2012","unstructured":"Chiniforooshan, E., Daley, M., Ibarra, O.H., Kari, L., Seki, S.: One-reversal counter machines and multihead automata: Revisited. Theoretical Computer Science 454, 81\u201387 (2012)","journal-title":"Theoretical Computer Science"},{"unstructured":"Eremondi, J., Ibarra, O., McQuillan, I.: Insertion operations on deterministic reversal-bounded counter machines. Tech. Rep. 2014\u201301, University of Saskatchewan (2014). http:\/\/www.cs.usask.ca\/documents\/techreports\/2014\/TR-2014-01.pdf","key":"15_CR3"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"EM Gurari","year":"1981","unstructured":"Gurari, E.M., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences 22(2), 220\u2013229 (1981)","journal-title":"Journal of Computer and System Sciences"},{"issue":"03","key":"15_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0129054105003121","volume":"16","author":"Y Han","year":"2005","unstructured":"Han, Y., Wood, D.: The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science 16(03), 499\u2013510 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"unstructured":"Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley Pub. Co., Addison-Wesley series in computer science (1978)","key":"15_CR6"},{"unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)","key":"15_CR7"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"23","author":"OH Ibarra","year":"1995","unstructured":"Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput. 23(1), 123\u2013137 (1995)","journal-title":"SIAM J. Comput."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/00207160108805105","volume":"78","author":"H J\u00fcrgensen","year":"2001","unstructured":"J\u00fcrgensen, H., Kari, L., Thierrin, G.: Morphisms preserving densities. International Journal of Computer Mathematics 78, 165\u2013189 (2001)","journal-title":"International Journal of Computer Mathematics"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"ML Minsky","year":"1961","unstructured":"Minsky, M.L.: Recursive unsolvability of Post\u2019s problem of \"tag\" and other topics in theory of Turing Machines. Annals of Mathematics 74(3), 437\u2013455 (1961)","journal-title":"Annals of Mathematics"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C Nicaud","year":"1999","unstructured":"Nicaud, C.: Average state complexity of operations on unary automata. In: Kuty\u0142owski, M., Pacholski, L., Wierzbicki, T. (eds.) Mathematical Foundations of Computer Science 1999. Lecture Notes in Computer Science, vol. 1672, pp. 231\u2013240. Springer, Berlin Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:15:01Z","timestamp":1676434501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}