{"id":"https://openalex.org/W4411141676","doi":"https://doi.org/10.1145/3725225","title":"A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity","display_name":"A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity","publication_year":2025,"publication_date":"2025-06-09","ids":{"openalex":"https://openalex.org/W4411141676","doi":"https://doi.org/10.1145/3725225"},"language":"en","primary_location":{"id":"doi:10.1145/3725225","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725225","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3725225","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"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 Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3725225","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033060526","display_name":"Stefan Mengel","orcid":"https://orcid.org/0000-0003-1386-8784"},"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/I4210115519","display_name":"Centre de Recherche en Informatique","ror":"https://ror.org/020cdve92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I4210091621","https://openalex.org/I4210115519","https://openalex.org/I70768539"]},{"id":"https://openalex.org/I44563897","display_name":"Universit\u00e9 d'Artois","ror":"https://ror.org/053x9s498","country_code":"FR","type":"education","lineage":["https://openalex.org/I44563897"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Stefan Mengel","raw_affiliation_strings":["Univ. Artois, CNRS, Centre de Recherche en Informatique de Lens (CRIL), Lens, France"],"raw_orcid":"https://orcid.org/0000-0003-1386-8784","affiliations":[{"raw_affiliation_string":"Univ. Artois, CNRS, Centre de Recherche en Informatique de Lens (CRIL), Lens, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210115519","https://openalex.org/I44563897"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089056875","display_name":"Harry Vinall-Smeeth","orcid":"https://orcid.org/0000-0003-2422-9435"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Harry Vinall-Smeeth","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, Ilmenau, Th\u00fcringen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2422-9435","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, Ilmenau, Th\u00fcringen, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0747,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82823087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":94},"biblio":{"volume":"3","issue":"2","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9995999932289124,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9995999932289124,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9986000061035156,"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/context-free-grammar","display_name":"Context-free grammar","score":0.6889658570289612},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.6563804149627686},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6413712501525879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5978654026985168},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.5564565062522888},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4897499084472656},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.48571333289146423},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.47142165899276733},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.46897539496421814},{"id":"https://openalex.org/keywords/stochastic-context-free-grammar","display_name":"Stochastic context-free grammar","score":0.464009165763855},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41844186186790466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3679081201553345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28123441338539124},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21681725978851318},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.08765965700149536}],"concepts":[{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.6889658570289612},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.6563804149627686},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6413712501525879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5978654026985168},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.5564565062522888},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4897499084472656},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.48571333289146423},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.47142165899276733},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.46897539496421814},{"id":"https://openalex.org/C199624470","wikidata":"https://www.wikidata.org/wiki/Q2377216","display_name":"Stochastic context-free grammar","level":5,"score":0.464009165763855},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41844186186790466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3679081201553345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28123441338539124},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21681725978851318},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.08765965700149536},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3725225","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725225","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3725225","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"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 Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:www.db-thueringen.de:dbt_mods_00069811","is_oa":true,"landing_page_url":"https://www.db-thueringen.de/receive/dbt_mods_00069811","pdf_url":"https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00071079/2836-6573_3_2025_88.pdf","source":{"id":"https://openalex.org/S4306400120","display_name":"Common Library Network (Der Gemeinsame Bibliotheksverbund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210149878","host_organization_name":"Verbundzentrale des GBV","host_organization_lineage":["https://openalex.org/I4210149878"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:HAL:hal-05374063v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05374063","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 Management of Data, 2025, 3 (2), pp.1-19. ⟨10.1145/3725225⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3725225","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3725225","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3725225","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"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 Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3468724208","display_name":null,"funder_award_id":"EQUUS ANR-19-CE48-0019","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G5606848604","display_name":null,"funder_award_id":"414325841","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411141676.pdf","grobid_xml":"https://content.openalex.org/works/W4411141676.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1994584977","https://openalex.org/W1997315904","https://openalex.org/W2025380793","https://openalex.org/W2028659807","https://openalex.org/W2050100848","https://openalex.org/W2052653988","https://openalex.org/W2055190789","https://openalex.org/W2094856502","https://openalex.org/W2105197197","https://openalex.org/W2113123266","https://openalex.org/W2130956967","https://openalex.org/W2171818384","https://openalex.org/W2284514301","https://openalex.org/W2514575731","https://openalex.org/W2576122162","https://openalex.org/W2592249290","https://openalex.org/W2592257482","https://openalex.org/W2963341173","https://openalex.org/W3168891650","https://openalex.org/W4211154544","https://openalex.org/W4245857357","https://openalex.org/W4282827770","https://openalex.org/W4282829303","https://openalex.org/W4282835527","https://openalex.org/W4287256396","https://openalex.org/W4287327128","https://openalex.org/W4287642550","https://openalex.org/W4386977540","https://openalex.org/W4396904527","https://openalex.org/W4398197199","https://openalex.org/W4400025441","https://openalex.org/W4401183437","https://openalex.org/W6910307883","https://openalex.org/W6947460739"],"related_works":["https://openalex.org/W2403874525","https://openalex.org/W1980918784","https://openalex.org/W2041988689","https://openalex.org/W1969069928","https://openalex.org/W2345119559","https://openalex.org/W1558874415","https://openalex.org/W1608157979","https://openalex.org/W1557335907","https://openalex.org/W2070208002","https://openalex.org/W1963896666"],"abstract_inverted_index":{"Motivated":[0],"by":[1,13,24,36,45,60,72],"recent":[2,22,101],"connections":[3],"to":[4,81,99,104],"factorised":[5],"databases,":[6],"we":[7,19,51,94],"analyse":[8],"the":[9,53,79,106],"efficiency":[10],"of":[11,63,90],"representations":[12,35],"context":[14],"free":[15],"grammars":[16],"(CFGs).":[17],"Concretely,":[18],"prove":[20],"a":[21,64,83,87,100,117,127],"conjecture":[23],"Kimelfeld,":[25],"Martens,":[26],"and":[27],"Niewerth":[28],"(ICDT":[29],"2025),":[30],"that":[31,67,116],"for":[32,58],"finite":[33,65,118,129],"languages":[34],"general":[37],"CFGs":[38,62],"can":[39,68],"be":[40,70],"doubly-exponentially":[41],"smaller":[42,124],"than":[43,131],"those":[44],"unambiguous":[46,61,134],"CFGs.":[47,74],"To":[48],"do":[49],"so,":[50],"show":[52,105],"first":[54,77],"exponential":[55],"lower":[56,84,110],"bounds":[57],"representation":[59,125],"language":[66,119],"efficiently":[69],"represented":[71],"ambiguous":[73],"Our":[75,112],"proof":[76],"reduces":[78],"problem":[80],"proving":[82],"bound":[85],"in":[86,97],"non-standard":[88],"model":[89],"communication":[91,108],"complexity.":[92],"Then,":[93],"argue":[95],"similarly":[96],"spirit":[98],"discrepancy":[102],"argument":[103],"required":[107],"complexity":[109],"bound.":[111],"result":[113],"also":[114],"implies":[115],"may":[120],"admit":[121],"an":[122,133],"exponentially":[123],"as":[126,132],"nondeterministic":[128],"automaton":[130],"CFG.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-06-10T00:00:00"}