{"id":"https://openalex.org/W4390605054","doi":"https://doi.org/10.1145/3632876","title":"On Learning Polynomial Recursive Programs","display_name":"On Learning Polynomial Recursive Programs","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390605054","doi":"https://doi.org/10.1145/3632876"},"language":"en","primary_location":{"id":"doi:10.1145/3632876","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632876","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632876","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3632876","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093123194","display_name":"Alex Buna-Marginean","orcid":"https://orcid.org/0009-0005-0750-445X"},"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":"Alex Buna-Marginean","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"raw_orcid":"https://orcid.org/0009-0005-0750-445X","affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065695523","display_name":"Vincent Cheval","orcid":"https://orcid.org/0000-0002-3622-2129"},"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":"Vincent Cheval","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0002-3622-2129","affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005502598","display_name":"Mahsa Shirmohammadi","orcid":"https://orcid.org/0000-0002-7779-2339"},"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/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210091437","display_name":"Sorbonne Paris Cit\u00e9","ror":"https://ror.org/001z21q04","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210091437"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mahsa Shirmohammadi","raw_affiliation_strings":["CNRS - IRIF - Universit\u00e9 Paris Cit\u00e9, Paris, France"],"raw_orcid":"https://orcid.org/0000-0002-7779-2339","affiliations":[{"raw_affiliation_string":"CNRS - IRIF - Universit\u00e9 Paris Cit\u00e9, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210091437","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068165188","display_name":"James Worrell","orcid":"https://orcid.org/0000-0001-8151-2443"},"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":"James Worrell","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0001-8151-2443","affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6952,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85302767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"8","issue":"POPL","first_page":"1001","last_page":"1027"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8209139108657837},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.798088014125824},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7240611910820007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6177635192871094},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5905248522758484},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5844453573226929},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5428736805915833},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5324243903160095},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.5191280245780945},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5102837085723877},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4741056561470032},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4549519419670105},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4494941234588623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4387563169002533},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42810964584350586},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.41523805260658264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2620174288749695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24676015973091125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19871026277542114}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8209139108657837},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.798088014125824},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7240611910820007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6177635192871094},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5905248522758484},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5844453573226929},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5428736805915833},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5324243903160095},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.5191280245780945},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5102837085723877},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4741056561470032},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4549519419670105},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4494941234588623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4387563169002533},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42810964584350586},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.41523805260658264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2620174288749695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24676015973091125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19871026277542114},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3632876","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632876","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632876","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04806037v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04806037","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM on Programming Languages (POPL'24), Jan 2024, London, United Kingdom. pp.1001-1027, ⟨10.1145/3632876⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/3632876","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632876","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632876","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G12182266","display_name":"Formal Analysis and Design of AI-intensive Cyber-Physical Systems","funder_award_id":"ANR-20-JSTM-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4046670221","display_name":"Beyond Linear Dynamical Systems","funder_award_id":"EP/X033813/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6062457969","display_name":null,"funder_award_id":"ANR-22- CE48-0005, ANR-CREST-JST","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6207916419","display_name":null,"funder_award_id":"EP/X033813/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"},{"id":"https://openalex.org/G8115579621","display_name":"Verification and Synthesis of Algebraic Models","funder_award_id":"ANR-22-CE48-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G875582221","display_name":"EPSRC Centre for Doctoral Training in Modern Statistics and Statistical Machine Learning","funder_award_id":"EP/S023151/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338075","display_name":"Core Research for Evolutional Science and Technology","ror":"https://ror.org/00097mb19"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390605054.pdf","grobid_xml":"https://content.openalex.org/works/W4390605054.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W941301462","https://openalex.org/W1517109152","https://openalex.org/W1573881032","https://openalex.org/W1585981132","https://openalex.org/W1984151763","https://openalex.org/W1989445634","https://openalex.org/W2022333401","https://openalex.org/W2027413053","https://openalex.org/W2027671360","https://openalex.org/W2110221038","https://openalex.org/W2500265108","https://openalex.org/W2610179689","https://openalex.org/W2612425693","https://openalex.org/W2914905200","https://openalex.org/W2977245035","https://openalex.org/W3023251497","https://openalex.org/W4210406996","https://openalex.org/W4210678036","https://openalex.org/W4237137404","https://openalex.org/W4245405893","https://openalex.org/W4255971878","https://openalex.org/W4390605054"],"related_works":["https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W1975910189","https://openalex.org/W2368684504","https://openalex.org/W3143588635","https://openalex.org/W4386400090","https://openalex.org/W2371400076","https://openalex.org/W2030569822","https://openalex.org/W1976338306","https://openalex.org/W2160879187"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,16,24,27,42,55,65,110,128],"class":[3],"of":[4,11,18,26,44,57],"P-finite":[5,30,72,76,94],"automata.":[6],"These":[7],"are":[8,123],"a":[9,51,69,83,121],"generalisation":[10],"weighted":[12,118],"automata,":[13],"in":[14,40,99,102,127],"which":[15,41],"weights":[17],"transitions":[19],"can":[20,32,47,96],"depend":[21],"polynomially":[22],"on":[23],"length":[25],"input":[28],"word.":[29],"automata":[31,73,95,116,119],"also":[33],"be":[34,97],"viewed":[35],"as":[36],"simple":[37],"tail-recursive":[38],"programs":[39],"arguments":[43],"recursive":[45,58],"calls":[46],"non-linearly":[48],"refer":[49],"to":[50],"variable":[52],"that":[53,67,78,81,93,113],"counts":[54],"number":[56],"calls.":[59],"The":[60],"nomenclature":[61],"is":[62],"motivated":[63],"by":[64],"fact":[66],"over":[68,120],"unary":[70],"alphabet":[71],"compute":[74],"so-called":[75],"sequences,":[77],"is,":[79],"sequences":[80],"satisfy":[82],"linear":[84],"recurrence":[85],"with":[86],"polynomial":[87,100],"coefficients.":[88],"Our":[89],"main":[90],"result":[91],"shows":[92],"learned":[98],"time":[101],"Angluin\u2019s":[103],"MAT":[104,129],"exact":[105],"learning":[106],"model.":[107,130],"This":[108],"generalises":[109],"classical":[111],"results":[112],"deterministic":[114],"finite":[115],"and":[117],"field":[122],"respectively":[124],"polynomial-time":[125],"learnable":[126]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}