{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:00Z","timestamp":1772164080013,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K009907\/1 and EP\/M023974\/1"],"award-info":[{"award-number":["EP\/K009907\/1 and EP\/M023974\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837627","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"151-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Unboundedness and downward closures of higher-order pushdown automata"],"prefix":"10.1145","author":[{"given":"Matthew","family":"Hague","sequence":"first","affiliation":[{"name":"University of London, UK"}]},{"given":"Jonathan","family":"Kochems","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}]},{"given":"C.-H. Luke","family":"Ong","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31982-5_31"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321488"},{"key":"e_1_3_2_1_3_1","volume-title":"STACS","author":"Bojanczyk M.","year":"2010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_36"},{"key":"e_1_3_2_1_5_1","volume-title":"CSL","author":"Broadbent C. H.","year":"2013"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.40"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_18"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500589"},{"key":"e_1_3_2_1_9_1","first-page":"178","article-title":"On constructing obstruction sets of words","volume":"44","author":"Courcelle B.","year":"1991","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_38"},{"key":"e_1_3_2_1_11_1","unstructured":"W. Czerwinski and W. Martens. A note on decidable separability by piecewise testable languages. CoRR abs\/1410.1042 2014. URL http:\/\/arxiv.org\/abs\/1410.1042.  W. Czerwinski and W. Martens. A note on decidable separability by piecewise testable languages. CoRR abs\/1410.1042 2014. URL http:\/\/arxiv.org\/abs\/1410.1042."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926443"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325697"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00139-1"},{"key":"e_1_3_2_1_15_1","volume-title":"FSTTCS","author":"Hague M.","year":"2013"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603112"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_22"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.34"},{"key":"e_1_3_2_1_19_1","unstructured":"M. Hague J. Kochems and C. L. Ong. Unboundedness and downward closures of higher-order pushdown automata. CoRR abs\/1507.03304 2015. URL http:\/\/arxiv.org\/abs\/1507.03304.  M. Hague J. Kochems and C. L. Ong. Unboundedness and downward closures of higher-order pushdown automata. CoRR abs\/1507.03304 2015. URL http:\/\/arxiv.org\/abs\/1507.03304."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80111-0"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.45"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646794.704852"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_117"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599415"},{"key":"e_1_3_2_1_25_1","unstructured":"N. Kobayashi. GTR EC S2: A model checker for recursion schemes based on games and types. A tool available at http:\/\/www-kb.is. s.u-tokyo.ac.jp\/~koba\/gtrecs2\/ 2012.  N. Kobayashi. GTR EC S2: A model checker for recursion schemes based on games and types. A tool available at http:\/\/www-kb.is. s.u-tokyo.ac.jp\/~koba\/gtrecs2\/ 2012."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_24"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993525"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0078-9"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926419"},{"key":"e_1_3_2_1_30_1","first-page":"1170","article-title":"Multilevel stack automata","volume":"15","author":"Maslov A. N.","year":"1976","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364578"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.62"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20297-6_24"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349241"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535873"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04420-5_19"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23217-6_14"},{"key":"e_1_3_2_1_38_1","volume-title":"CONCUR","author":"Torre S. L.","year":"2015"},{"key":"e_1_3_2_1_39_1","volume-title":"APLAS","author":"Unno H.","year":"2010"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90156-5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:37Z","timestamp":1750211017000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":41,"alternative-id":["10.1145\/2837614.2837627","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837627","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837627","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}