{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:42:07Z","timestamp":1743014527584,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"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-98654-8_34","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"416-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalizations of Checking Stack Automata: Characterizations and Hierarchies"],"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,8,5]]},"reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0022-0000(70)80004-6","volume":"4","author":"AV Aho","year":"1970","unstructured":"Aho, A.V., Ullman, J.D., Hopcroft, J.E.: On the computational power of pushdown automata. J. Comput. Syst. Sci. 4(2), 129\u2013136 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0890-5401(89)90015-1","volume":"80","author":"J Engelfriet","year":"1989","unstructured":"Engelfriet, J.: The power of two-way deterministic checking stack automata. Inf. Comput. 80(2), 114\u2013120 (1989)","journal-title":"Inf. Comput."},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/321371.321385","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S., Harrison, M.: Stack automata and compiling. J. ACM 14(1), 172\u2013201 (1967)","journal-title":"J. ACM"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","volume":"3","author":"S Greibach","year":"1969","unstructured":"Greibach, S.: Checking automata and one-way stack languages. J. Comput. Syst. Sci. 3(2), 196\u2013217 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR5","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":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0022-0000(71)80029-6","volume":"5","author":"OH Ibarra","year":"1971","unstructured":"Ibarra, O.H.: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J. Comput. Syst. Sci. 5(2), 88\u2013117 (1971)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","volume":"7","author":"OH Ibarra","year":"1973","unstructured":"Ibarra, O.H.: On two-way multihead automata. J. Comput. Syst. Sci. 7(1), 28\u201336 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.04.024","volume":"738","author":"OH Ibarra","year":"2018","unstructured":"Ibarra, O.H., McQuillan, I.: Variations of checking stack automata: obtaining unexpected decidability properties. Theoret. Comput. Sci. 738, 1\u201312 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0022-0000(78)90010-7","volume":"17","author":"K King","year":"1978","unstructured":"King, K., Wrathall, C.: Stack languages and log n space. J. Comput. Syst. Sci. 17(3), 281\u2013299 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1051\/ita\/1980140100671","volume":"14","author":"B Monien","year":"1980","unstructured":"Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO. Informatique Th\u00e9orique 14(1), 67\u201382 (1980)","journal-title":"RAIRO. Informatique Th\u00e9orique"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0022-0000(77)80042-1","volume":"14","author":"JI Seiferas","year":"1977","unstructured":"Seiferas, J.I.: Relating refined space complexity classes. J. Comput. Syst. Sci. 14(1), 100\u2013129 (1977)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:18:06Z","timestamp":1535915886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}