{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:45:59Z","timestamp":1725860759999},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_10","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T11:52:20Z","timestamp":1467719540000},"page":"113-124","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Simulation Result for Two-Way Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(68)91087-5","volume":"13","author":"AV Aho","year":"1968","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Time and tape complexity of pushdown automaton languages. Inf. Control 13(3), 186\u2013206 (1968)","journal-title":"Inf. Control"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-51237-3_11","volume-title":"Logic at Botik \u201989","author":"T Amtoft-Hansen","year":"1989","unstructured":"Amtoft-Hansen, T., Nikolajsen, T., Tr\u00e4ff, J.L., Jones, N.D.: Experiments with implementations of two theoretical constructions. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 119\u2013133. Springer, Heidelberg (1989)"},{"issue":"1","key":"10_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/963778.963784","volume":"26","author":"NH Christensen","year":"2004","unstructured":"Christensen, N.H., Gl\u00fcck, R.: Offline partial evaluation can be as accurate as online partial evaluation. ACM TOPLAS 26(1), 191\u2013220 (2004)","journal-title":"ACM TOPLAS"},{"issue":"1","key":"10_CR4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"SA Cook","year":"1971","unstructured":"Cook, S.A.: Characterizations of pushdown machines in terms of time-bounded computers. J. ACM 18(1), 4\u201318 (1971)","journal-title":"J. ACM"},{"key":"10_CR5","unstructured":"Cook, S.A.: Linear time simulation of deterministic two-way pushdown automata. In: Freiman, C.V., Griffith, J.E., Rosenfeld, J.L. (eds.) Information Processing 71, pp. 75\u201380. North-Holland, Amsterdam (1972)"},{"issue":"6","key":"10_CR6","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1002\/spe.1086","volume":"42","author":"R Gl\u00fcck","year":"2012","unstructured":"Gl\u00fcck, R.: A self-applicable online partial evaluator for recursive flowchart languages. Softw. Pract. Experience 42(6), 649\u2013673 (2012)","journal-title":"Softw. Pract. Experience"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.4204\/EPTCS.129.15","volume":"129","author":"R Gl\u00fcck","year":"2013","unstructured":"Gl\u00fcck, R.: Simulation of two-way pushdown automata revisited. Electron. Proc. Theor. Comput. Sci. 129, 250\u2013258 (2013)","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R.: Maximally-polyvariant partial evaluation in polynomial time. In: Mazzara, M., Voronkov, A. (eds.) Perspectives of System Informatics. LNCS, vol. 9609, pp. 149\u2013157. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-41579-6_11"},{"key":"10_CR9","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68954-8","volume-title":"Parsing Techniques: A Practical Guide","author":"D Grune","year":"2008","unstructured":"Grune, D., Jacobs, C.J.H.: Parsing Techniques: A Practical Guide. Monographs in Computer Science, 2nd edn. Springer, New York (2008)","edition":"2"},{"issue":"4","key":"10_CR10","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0020-0190(77)90022-9","volume":"6","author":"ND Jones","year":"1977","unstructured":"Jones, N.D.: A note on linear time simulation of deterministic two-way pushdown automata. Inf. Process. Lett. 6(4), 110\u2013112 (1977)","journal-title":"Inf. Process. Lett."},{"key":"10_CR11","volume-title":"Partial Evaluation and Automatic Program Generation","author":"ND Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Upper Saddle River (1993)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(83)90124-2","volume":"16","author":"W Rytter","year":"1983","unstructured":"Rytter, W.: A simulation result for two-way pushdown automata. Inf. Process. Lett. 16(4), 199\u2013202 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"10_CR14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/S0019-9958(85)80024-3","volume":"67","author":"W Rytter","year":"1985","unstructured":"Rytter, W.: Fast recognition of pushdown automaton and context-free languages. Inf. Control 67(1\u20133), 12\u201322 (1985)","journal-title":"Inf. Control"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1885-0","volume-title":"Efficient Parsing for Natural Language","author":"M Tomita","year":"1986","unstructured":"Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston (1986)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:50:47Z","timestamp":1498326647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}