{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:03:47Z","timestamp":1725595427296},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223204"},{"type":"electronic","value":"9783642223211"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_36","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"417-428","source":"Crossref","is-referenced-by-count":1,"title":["Models of Pushdown Automata with Reset"],"prefix":"10.1007","author":[{"given":"Nuri","family":"Ta\u015fdemi\u0307r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. C. Cem","family":"Say","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Freivalds, R., Karpinski, M.: Lower space bounds for randomized computation. In: ICALP 1994, pp. 580\u2013592 (1994)","DOI":"10.1007\/3-540-58201-0_100"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44411-4_22","volume-title":"SOFSEM 2000: Theory and Practice of Informatics","author":"M. Golovkins","year":"2000","unstructured":"Golovkins, M.: Quantum pushdown automata. In: Jeffery, K., Hlav\u00e1\u010d, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol.\u00a01963, pp. 336\u2013346. Springer, Heidelberg (2000)"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Gray, J.N., Harrison, M.A., Ibarra, O.H.: Two-way pushdown automata. Information and Control\u00a011(1-2), 30\u201370 (1967)","DOI":"10.1016\/S0019-9958(67)90369-5"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Hoogeboom, H.J., Engelfriet, J.: Pushdown automata. In: Formal Languages and Applications. SFSC, ch. 6, vol.\u00a0148, pp. 117\u2013138. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-39886-8_6"},{"key":"36_CR5","volume-title":"Formal languages and their relation to automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Addison-Wesley Longman Publishing Co., Boston (1969)"},{"issue":"8","key":"36_CR6","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1016\/j.ic.2009.11.001","volume":"208","author":"J. Hromkovic","year":"2010","unstructured":"Hromkovic, J., Schnitger, G.: On probabilistic pushdown automata. Information and Computation\u00a0208(8), 982\u2013995 (2010)","journal-title":"Information and Computation"},{"key":"36_CR7","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Proch\u00e1zka, M., Vogel, J.: Deleting automata with a restart operation. In: Bozapalidis, S. (ed.) Proceedings of DLT 1997, Greece, pp. 191\u2013202 (1997)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata. LNCS, vol.\u00a0965, pp. 283\u2013292 (1995)","DOI":"10.1007\/3-540-60249-6_60"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01762237","volume":"7","author":"L.Y. Liu","year":"1973","unstructured":"Liu, L.Y., Weiner, P.: An infinite hierarchy of intersections of context-free languages. Mathematical Systems Theory\u00a07, 185\u2013192 (1973)","journal-title":"Mathematical Systems Theory"},{"key":"36_CR10","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. A. Lang. Comb.\u00a06, 519\u2013535 (2001)","journal-title":"J. A. Lang. Comb."},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J.C. Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal of Research and Development\u00a03, 198\u2013200 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Stearns, R.E., Hartmanis, J., Lewis II, P.M.: Hierarchies of memory limited computations. In: SWCT 1965, pp. 179\u2013190 (1965)","DOI":"10.1109\/FOCS.1965.11"},{"key":"36_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58355-6","volume-title":"Turing Machines with Sublogarithmic Space","author":"A. Szepietowski","year":"1994","unstructured":"Szepietowski, A.: Turing Machines with Sublogarithmic Space. Springer, Heidelberg (1994)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/0022-0000(78)90030-2","volume":"16","author":"D. Wotschke","year":"1978","unstructured":"Wotschke, D.: Nondeterminism and boolean operations in PDA\u2019s. Journal of Computer and System Sciences\u00a016, 456\u2013461 (1978)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"36_CR15","first-page":"19","volume":"12","author":"A. Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Cem Say, A.C.: Succinctness of two-way probabilistic and quantum finite automata. DMTCS\u00a012(4), 19\u201340 (2010)","journal-title":"DMTCS"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Yakary\u0131lmaz, A., Cem Say, A.C.: Unbounded-error quantum computation with small space bounds. Technical Report arXiv:1007.3624 (2010)","DOI":"10.1016\/j.ic.2011.01.008"}],"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-642-22321-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T20:27:47Z","timestamp":1560371267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}