{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:19:55Z","timestamp":1781075995184,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403125","type":"print"},{"value":"9783642403132","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_47","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"528-539","source":"Crossref","is-referenced-by-count":1,"title":["Reachability in Higher-Order-Counters"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Heu\u00dfner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Kartzow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-30538-5_12","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouajjani","year":"2004","unstructured":"Bouajjani, A., Meyer, A.: Symbolic reachability analysis of higher-order context-free processes. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 135\u2013147. Springer, Heidelberg (2004)"},{"key":"47_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.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 165\u2013176. Springer, Heidelberg (2012)"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11549345_16","volume-title":"Mathematical Foundations of Computer Science 2005","author":"A. Carayol","year":"2005","unstructured":"Carayol, A.: Regular sets of higher-order pushdown stacks. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 168\u2013179. Springer, Heidelberg (2005)"},{"key":"47_CR5","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":"47_CR6","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","key":"47_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0890-5401(91)90015-T","volume":"95","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Iterated stack automata and complexity classes. Inf. Comput.\u00a095(1), 21\u201375 (1991)","journal-title":"Inf. Comput."},{"issue":"2","key":"47_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2008.04.008","volume":"108","author":"S. G\u00f6ller","year":"2008","unstructured":"G\u00f6ller, S.: Reachability on prefix-recognizable graphs. Inf. Process. Lett.\u00a0108(2), 71\u201374 (2008)","journal-title":"Inf. Process. Lett."},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Hague, M., Ong, C.-H.L.: Symbolic backwards-reachability analysis for higher-order pushdown systems. LMCS\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:14)2008"},{"key":"47_CR10","unstructured":"Heu\u00dfner, A., Kartzow, A.: Reachability in higher-order-counters. CoRR, arxiv:1306.1069 (2013), \n                  \n                    http:\/\/arxiv.org\/abs\/1306.1069"},{"issue":"5","key":"47_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ipl.2007.06.006","volume":"104","author":"P. Jancar","year":"2007","unstructured":"Jancar, P., Sawa, Z.: A note on emptiness for alternating finite automata with a one-letter alphabet. Inf. Process. Lett.\u00a0104(5), 164\u2013167 (2007)","journal-title":"Inf. Process. Lett."},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Kartzow, A.: Collapsible pushdown graphs of level 2 are tree-automatic. Logical Methods in Computer Science\u00a09(1) (2013)","DOI":"10.2168\/LMCS-9(1:12)2013"},{"key":"47_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-32589-2_50","volume-title":"Mathematical Foundations of Computer Science 2012","author":"A. Kartzow","year":"2012","unstructured":"Kartzow, A., Parys, P.: Strictness of the collapsible pushdown hierarchy. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 566\u2013577. Springer, Heidelberg (2012)"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Pumping by typing. To appear in Proc. LICS (2013)","DOI":"10.1109\/LICS.2013.46"},{"key":"47_CR15","first-page":"1170","volume":"15","author":"A.N. Maslov","year":"1974","unstructured":"Maslov, A.N.: The hierarchy of indexed languages of an arbitrary level. Sov. Math., Dokl.\u00a015, 1170\u20131174 (1974)","journal-title":"Sov. Math., Dokl."},{"key":"47_CR16","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":"47_CR17","unstructured":"Parys, P.: Variants of collapsible pushdown systems. In: Proc. of CSL 2012. LIPIcs, vol.\u00a016, pp. 500\u2013515 (2012)"},{"key":"47_CR18","unstructured":"Slaats, M.: Infinite regular games in the higher-order pushdown and the parametrized setting. PhD thesis, RWTH Aachen (2012)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:11:22Z","timestamp":1558303882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}