{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T08:53:23Z","timestamp":1725958403778},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319732152"},{"type":"electronic","value":"9783319732169"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73216-9_17","type":"book-chapter","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T08:48:42Z","timestamp":1519634922000},"page":"357-372","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Input-Position-Restricted Models of Language Acceptors"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"McQuillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,27]]},"reference":[{"key":"17_CR1","volume-title":"Handbook of Formal Languages","author":"JM Autebert","year":"1997","unstructured":"Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bensch, S., Bj\u00f6rklund, J., Kutrib, M.: Deterministic stack transducers. In: Han, Y.-S., Salomaa, K. (eds.) Implementation and Application of Automata: 21st International Conference, CIAA 2016, Seoul, South Korea, 19\u201322 July 2016, Proceedings. Lecture Notes in Computer Science, vol. 9705, pp. 27\u201338. Springer International Publishing, Berlin (2016)","DOI":"10.1007\/978-3-319-40946-7_3"},{"issue":"08","key":"17_CR3","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1142\/S0129054112400709","volume":"23","author":"M Cadilhac","year":"2012","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Bounded Parikh automata. Int. J. Found. Comput. Sci. 23(08), 1691\u20131709 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1051\/ita\/2012013","volume":"46","author":"M Cadilhac","year":"2012","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Affine Parikh automata. RAIRO - Theor. Inf. Appl. 46, 511\u2013545 (2012)","journal-title":"RAIRO - Theor. Inf. Appl."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Chiniforooshan, E., Daley, M., Ibarra, O.H., Kari, L., Seki, S.: One-reversal counter machines and multihead automata: revisited. In: Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM\u201911, pp. 166\u2013177. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-18381-2_14"},{"key":"17_CR6","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 454, 81\u201387 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR7","first-page":"1","volume":"TBA","author":"J Eremondi","year":"2017","unstructured":"Eremondi, J., Ibarra, O.H., McQuillan, I.: Deletion operations on deterministic families of automata. Inf. Comput. TBA, 1\u201320 (2017)","journal-title":"Inf. Comput."},{"issue":"6","key":"17_CR8","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., Greibach, S.: Deterministic context free languages. Inf. Control 9(6), 620\u2013648 (1966)","journal-title":"Inf. Control"},{"issue":"2","key":"17_CR9","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 22(2), 220\u2013229 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"17_CR10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1006\/jcss.2002.1836","volume":"65","author":"T Harju","year":"2002","unstructured":"Harju, T., Ibarra, O., Karhumki, J., Salomaa, A.: Some decision problems concerning semilinearity and commutation. J. Comput. Syst. Sci. 65(2), 278\u2013294 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"3\u20134","key":"17_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/FI-2016-1436","volume":"148","author":"OH Ibarra","year":"2016","unstructured":"Ibarra, O.H.: Visibly pushdown automata and transducers with counters. Fundam. Inform. 148(3\u20134), 291\u2013308 (2016)","journal-title":"Fundam. Inform."},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2016.02.034","volume":"627","author":"OH Ibarra","year":"2016","unstructured":"Ibarra, O.H., McQuillan, I.: The effect of end-markers on counter machines and commutativity. Theor. Comput. Sci. 627, 71\u201381 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR14","unstructured":"Ibarra, O.H., McQuillan, I.: Applications of store languages to reachability (submitted, 2017)"},{"key":"17_CR15","unstructured":"Ibarra, O.H., McQuillan, I.: On store languages of language acceptors (submitted, 2017). https:\/\/arxiv.org\/abs\/1702.07388"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.tcs.2011.12.034","volume":"429","author":"OH Ibarra","year":"2012","unstructured":"Ibarra, O.H., Yen, H.C.: On the containment and equivalence problems for two-way transducers. Theor. Comput. Sci. 429, 155\u2013163 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR17","doi-asserted-by":"crossref","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. J. ACM 25(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"issue":"6","key":"17_CR18","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1142\/S0129054112400539","volume":"23","author":"OH Ibarra","year":"2012","unstructured":"Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. Int. J. Found. Comput. Sci. 23(6), 1291\u20131306 (2012)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Emergence, Complexity and Computation","Reversibility and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73216-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T17:39:16Z","timestamp":1570815556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73216-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319732152","9783319732169"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73216-9_17","relation":{},"ISSN":["2194-7287","2194-7295"],"issn-type":[{"type":"print","value":"2194-7287"},{"type":"electronic","value":"2194-7295"}],"subject":[],"published":{"date-parts":[[2018]]}}}