{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:42:45Z","timestamp":1725698565198},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_50","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T04:44:32Z","timestamp":1343796272000},"page":"566-577","source":"Crossref","is-referenced-by-count":13,"title":["Strictness of the Collapsible Pushdown Hierarchy"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kartzow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Parys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-540-31982-5_31","volume-title":"Foundations of Software Science and Computational Structures","author":"K. Aehlig","year":"2005","unstructured":"Aehlig, K., de Miranda, J.G., Ong, C.-H.L.: Safety Is not a Restriction at Level 2 for String Languages. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 490\u2013504. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"50_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2008.01.053","volume":"400","author":"A. Blumensath","year":"2008","unstructured":"Blumensath, A.: On the structure of graphs in the caucal hierarchy. Theor. Comput. Sci.\u00a0400(1-3), 19\u201345 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-31585-5_18","volume-title":"Automata, Languages, and Programming","author":"C. Broadbent","year":"2012","unstructured":"Broadbent, C., Carayol, A., Hague, M., Serre, O.: A Saturation Method for Collapsible Pushdown Systems. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Automata, Languages, and Programming, Part II. LNCS, vol.\u00a07392, pp. 165\u2013176. Springer, Heidelberg (2012)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"issue":"1&2","key":"50_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(96)00244-7","volume":"163","author":"R.H. Gilman","year":"1996","unstructured":"Gilman, R.H.: A shrinking lemma for indexed languages. Theor. Comput. Sci.\u00a0163(1&2), 277\u2013281 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Hague, M., Murawski, A.S., Ong, C.-H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: LICS, pp. 452\u2013461. IEEE Computer Society (2008)","DOI":"10.1109\/LICS.2008.34"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2977\/prims\/1195192738","volume":"9","author":"T. Hayashi","year":"1973","unstructured":"Hayashi, T.: On derivation trees of indexed grammars. Publ. RIMS, Kyoto Univ.\u00a09, 61\u201392 (1973)","journal-title":"Publ. RIMS, Kyoto Univ."},{"key":"50_CR9","unstructured":"Kartzow, A.: A pumping lemma for collapsible pushdown graphs of level 2. In: Bezem, M. (ed.) CSL. LIPIcs, vol.\u00a012, pp. 322\u2013336. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Kartzow, A., Parys, P.: Strictness of the collapsible pushdown hierarchy. CoRR, abs\/1201.3250 (2012)","DOI":"10.1007\/978-3-642-32589-2_50"},{"key":"50_CR11","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":"50_CR12","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":"50_CR13","first-page":"38","volume":"12","author":"A.N. Maslov","year":"1976","unstructured":"Maslov, A.N.: Multilevel stack automata. Problems of Information Transmission\u00a012, 38\u201343 (1976)","journal-title":"Problems of Information Transmission"},{"key":"50_CR14","unstructured":"Parys, P.: Collapse operation increases expressive power of deterministic higher order pushdown automata. In: Schwentick, T., D\u00fcrr, C. (eds.) STACS. LIPIcs, vol.\u00a09, pp. 603\u2013614. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Parys, P.: On the significance of the collapse operation. In: To appear in LICS (2012)","DOI":"10.1109\/LICS.2012.62"},{"key":"50_CR16","unstructured":"Parys, P.: A pumping lemma for pushdown graphs of any level. In: D\u00fcrr, C., Wilke, T. (eds.) STACS. LIPIcs, vol.\u00a014, pp. 54\u201365. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:08:12Z","timestamp":1620115692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}