{"id":"https://openalex.org/W2748125909","doi":"https://doi.org/10.1145/3091122","title":"Collapsible Pushdown Automata and Recursion Schemes","display_name":"Collapsible Pushdown Automata and Recursion Schemes","publication_year":2017,"publication_date":"2017-07-31","ids":{"openalex":"https://openalex.org/W2748125909","doi":"https://doi.org/10.1145/3091122","mag":"2748125909"},"language":"en","primary_location":{"id":"doi:10.1145/3091122","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3091122","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083664380","display_name":"Matthew Hague","orcid":"https://orcid.org/0000-0003-4913-3800"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Matthew Hague","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000119795","display_name":"Andrzej S. Murawski","orcid":"https://orcid.org/0000-0002-4725-410X"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrzej S. Murawski","raw_affiliation_strings":["DIMAP and Department of Computer Science, University of Warwick, Coventry, United Kingdom"],"affiliations":[{"raw_affiliation_string":"DIMAP and Department of Computer Science, University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025152913","display_name":"C.-H. Luke Ong","orcid":"https://orcid.org/0000-0001-7509-680X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C.-H. Luke Ong","raw_affiliation_strings":["Department of Computer Science, University of Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003802384","display_name":"Olivier Serre","orcid":"https://orcid.org/0000-0001-5936-240X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Serre","raw_affiliation_strings":["IRIF, CNRS & Universit\u00e9 Paris Diderot -- Paris 7, Paris cedex 13, France"],"affiliations":[{"raw_affiliation_string":"IRIF, CNRS & Universit\u00e9 Paris Diderot -- Paris 7, Paris cedex 13, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083664380"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":null,"apc_paid":null,"fwci":1.4219,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8369561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"18","issue":"3","first_page":"1","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.5914000272750854,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.5914000272750854,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.1273999959230423,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.11590000241994858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7423791885375977},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6393768191337585},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.6350511312484741},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6347301602363586},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5450570583343506},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5377625823020935},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4907751977443695},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47093644738197327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3980928957462311},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.346628338098526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22484582662582397},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21004745364189148},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09436610341072083}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7423791885375977},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6393768191337585},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.6350511312484741},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6347301602363586},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5450570583343506},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5377625823020935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4907751977443695},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47093644738197327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3980928957462311},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.346628338098526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22484582662582397},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21004745364189148},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09436610341072083}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3091122","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3091122","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1443031647","display_name":null,"funder_award_id":"EP/C539753/1, EP/K009907/1 and EP/M023974/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2744107465","display_name":null,"funder_award_id":"EP/K009907/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6542465994","display_name":null,"funder_award_id":"EP/M023974/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W61447513","https://openalex.org/W1490858874","https://openalex.org/W1518696294","https://openalex.org/W1518704718","https://openalex.org/W1532945699","https://openalex.org/W1536303350","https://openalex.org/W1540068799","https://openalex.org/W1549097197","https://openalex.org/W1559784852","https://openalex.org/W1581467031","https://openalex.org/W1585989904","https://openalex.org/W1630483081","https://openalex.org/W1759451798","https://openalex.org/W1801913226","https://openalex.org/W1802033981","https://openalex.org/W1816620374","https://openalex.org/W1965611063","https://openalex.org/W1971835879","https://openalex.org/W1988436966","https://openalex.org/W1997143185","https://openalex.org/W2007098021","https://openalex.org/W2014771515","https://openalex.org/W2016313399","https://openalex.org/W2020520119","https://openalex.org/W2024130312","https://openalex.org/W2040871029","https://openalex.org/W2055765422","https://openalex.org/W2057225506","https://openalex.org/W2063307580","https://openalex.org/W2071164478","https://openalex.org/W2078866770","https://openalex.org/W2086727636","https://openalex.org/W2102644483","https://openalex.org/W2107093575","https://openalex.org/W2117813968","https://openalex.org/W2122698067","https://openalex.org/W2129233074","https://openalex.org/W2134918221","https://openalex.org/W2135035709","https://openalex.org/W2137230613","https://openalex.org/W2138316064","https://openalex.org/W2139254765","https://openalex.org/W2140476040","https://openalex.org/W2142927307","https://openalex.org/W2144286930","https://openalex.org/W2146549539","https://openalex.org/W2160005349","https://openalex.org/W2502103274","https://openalex.org/W2763666638","https://openalex.org/W3019389875","https://openalex.org/W3022006420","https://openalex.org/W3100465930","https://openalex.org/W4212777788","https://openalex.org/W4213252762"],"related_works":["https://openalex.org/W2256367468","https://openalex.org/W3021510591","https://openalex.org/W20126484","https://openalex.org/W2026901712","https://openalex.org/W2261425470","https://openalex.org/W2132220854","https://openalex.org/W2748125909","https://openalex.org/W2055765422","https://openalex.org/W66463465","https://openalex.org/W1464760834"],"abstract_inverted_index":{"We":[0],"consider":[1],"recursion":[2,28,72,159],"schemes":[3,73,160],"(not":[4],"assumed":[5],"to":[6,62,123,133,145,152],"be":[7],"homogeneously":[8],"typed":[9,34],",":[10,49],"and":[11,17,116,161],"hence":[12],"not":[13],"necessarily":[14],"safe":[15],")":[16],"use":[18],"them":[19],"as":[20,107],"generators":[21],"of":[22,67,77,97,139,142],"(possibly":[23],"infinite)":[24],"ranked":[25,147,170],"trees.":[26,171],"A":[27,58,102],"scheme":[29],"is":[30,61,128,151,173],"essentially":[31],"a":[32,75,105,134,146],"finite":[33],"deterministic":[35,98],"term":[36],"rewriting":[37,45],"system":[38],"that":[39,154],"generates,":[40],"when":[41],"one":[42],"applies":[43],"the":[44,68,137,143],"rules":[46],"ad":[47],"infinitum":[48],"an":[50,64,95,124],"infinite":[51,125,169],"tree,":[52,126],"called":[53],"its":[54,111,118],"value":[55],"tree":[56,106],".":[57],"fundamental":[59],"question":[60,86],"provide":[63],"equivalent":[65],"description":[66],"trees":[69],"generated":[70],"by":[71,74,87,175],"class":[76],"machines.":[78],"In":[79],"this":[80,84],"article,":[81],"we":[82],"answer":[83],"open":[85],"introducing":[88],"collapsible":[89,162],"pushdown":[90,100,163],"automata":[91],"(CPDA),":[92],"which":[93,121,127],"are":[94,165],"extension":[96],"(higher-order)":[99],"automata.":[101],"CPDA":[103,144],"generates":[104],"follows.":[108],"One":[109],"considers":[110],"transition":[112],"graph,":[113],"unfolds":[114],"it,":[115],"contracts":[117],"silent":[119],"transitions,":[120],"leads":[122],"finally":[129],"node":[130],"labelled":[131],"thanks":[132],"map":[135],"from":[136],"set":[138],"control":[140],"states":[141],"alphabet.":[148],"Our":[149],"contribution":[150],"prove":[153],"these":[155],"two":[156],"models,":[157],"higher-order":[158],"automata,":[164],"equi-expressive":[166],"for":[167],"generating":[168],"This":[172],"achieved":[174],"giving":[176],"effective":[177],"transformations":[178],"in":[179],"both":[180],"directions.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}