{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:04Z","timestamp":1759637584799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946306"},{"type":"electronic","value":"9783319946313"}],"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-94631-3_14","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"163-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["State Grammars with Stores"],"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,7,11]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-74932-2_10","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J\u00fcrgen Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1989)"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Finite turn pushdown automata. SIAM J. Control 4(3), 429\u2013453 (1966)","journal-title":"SIAM J. Control"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S Greibach","year":"1978","unstructured":"Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7, 311\u2013324 (1978)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"14_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. J. Comput. Syst. Sci. 22(2), 220\u2013229 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR5","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Formal Language Theory","author":"M Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Co., Boston (1978)"},{"issue":"8","key":"14_CR6","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/BF01178731","volume":"31","author":"D Hauschildt","year":"1994","unstructured":"Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica 31(8), 719\u2013728 (1994)","journal-title":"Acta Informatica"},{"key":"14_CR7","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)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2016.02.034","volume":"627","author":"O Ibarra","year":"2016","unstructured":"Ibarra, O., McQuillan, I.: The effect of end-markers on counter machines and commutativity. Theoret. Comput. Sci. 627, 71\u201381 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR9","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. J. ACM 25(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"14_CR10","unstructured":"Ibarra, O.H.: Grammatical characterizations of NPDAs and VPDAs with counters. In: Han, Y.S., Salomaa, K. (eds.) 21st International Conference on Implementation and Application of Automata, CIAA 2016, Seoul, South Korea. Lecture Notes in Computer Science, vol. 9705, p. 11 (2016). Invited abstract, journal version submitted"},{"issue":"5","key":"14_CR11","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/S0022-0000(70)80045-9","volume":"4","author":"T Kasai","year":"1970","unstructured":"Kasai, T.: An hierarchy between context-free and context-sensitive languages. J. Comput. Syst. Sci. 4(5), 492\u2013508 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/S0019-9958(73)90884-X","volume":"23","author":"E Moriya","year":"1973","unstructured":"Moriya, E.: Some remarks on state grammars and matrix grammars. Inf. Control 23, 48\u201357 (1973)","journal-title":"Inf. Control"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.tcs.2004.12.029","volume":"337","author":"E Moriya","year":"2005","unstructured":"Moriya, E., Hofbauer, D., Huber, M., Otto, F.: On state-alternating context-free grammars. Theoret. Comput. Sci. 337(1), 183\u2013216 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/S0019-9958(78)90635-6","volume":"39","author":"G Rozenberg","year":"1978","unstructured":"Rozenberg, G., Vermeir, D.: On the effect of the finite index restriction on several families of grammars. Inf. Control 39, 284\u2013302 (1978)","journal-title":"Inf. Control"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0019-9958(72)90332-4","volume":"20","author":"A Salomaa","year":"1972","unstructured":"Salomaa, A.: Matrix grammars with a leftmost restriction. Inf. Control 20(2), 143\u2013149 (1972)","journal-title":"Inf. Control"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Stiebe, R.: Slender matrix languages, pp. 375\u2013385. World Scientific (2000)","DOI":"10.1142\/9789812792464_0031"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:16:46Z","timestamp":1710325006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}