{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:16:55Z","timestamp":1725574615503},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_31","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"490-504","source":"Crossref","is-referenced-by-count":25,"title":["Safety Is not a Restriction at Level 2 for String Languages"],"prefix":"10.1007","author":[{"given":"K.","family":"Aehlig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. G.","family":"de Miranda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. -H. L.","family":"Ong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/11417170_5","volume-title":"Typed Lambda Calculi and Applications","author":"K. Aehlig","year":"2005","unstructured":"Aehlig, K., de Miranda, J.G., Ong, C.-H.L.: The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 39\u201354. Springer, Heidelberg (2005)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Aehlig, K., de Miranda, J.G., Ong, C.H.L.: Safety is not a restriction at level 2 for string languages. Technical Report PRG-RR-04-23, OUCL (2004)","DOI":"10.1007\/978-3-540-31982-5_31"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A. Aho","year":"1968","unstructured":"Aho, A.: Indexed grammars - an extension of context-free grammars. J. ACM\u00a015, 647\u2013671 (1968)","journal-title":"J. ACM"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"Damm, W.: The IO- and OI-hierarchy. TCS\u00a020, 95\u2013207 (1982)","journal-title":"TCS"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(86)80016-X","volume":"71","author":"W. Damm","year":"1986","unstructured":"Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Information and Control\u00a071, 1\u201332 (1986)","journal-title":"Information and Control"},{"key":"31_CR6","unstructured":"de Miranda, J.G., Ong, C.H.L.: A note on deterministic pushdown languages (2004), Available at http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/jolie.de.miranda"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-45413-6_21","volume-title":"Typed Lambda Calculi and Applications","author":"T. Knapik","year":"2001","unstructured":"Knapik, T., Niwi\u0144ski, D., Urzyczyn, P.: Deciding monadic theories of hyperalgebraic trees. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 253\u2013267. Springer, Heidelberg (2001)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45931-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"T. Knapik","year":"2002","unstructured":"Knapik, T., Niwi\u0144ski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 205\u2013222. Springer, Heidelberg (2002)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Knapik, T., Niwi\u0144ski, D., Urzyczyn, P., Walukiewicz, I.: Unsafe grammars, panic automata, and decidability, October 25 (2004)","DOI":"10.1007\/11523468_117"},{"key":"31_CR10","first-page":"1170","volume":"15","author":"A.N. Maslov","year":"1974","unstructured":"Maslov, A.N.: The hierarchy of indexed languages of an arbitrary level. Soviet Math. Dokl.\u00a015, 1170\u20131174 (1974)","journal-title":"Soviet Math. Dokl."},{"key":"31_CR11","unstructured":"Stirling, C.: Personal email communication, October 15 (2002)"},{"key":"31_CR12","unstructured":"Urzyczyn, P.: Personal email communication, July 26 (2003)"},{"key":"31_CR13","first-page":"238","volume-title":"Banff Higher Order Workshop","author":"M.Y. Vardi","year":"1995","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Banff Higher Order Workshop, pp. 238\u2013266. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:06:09Z","timestamp":1559941569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}