{"id":"https://openalex.org/W7167837984","doi":"https://doi.org/10.4230/lipics.lics.2026.69","title":"The Complexity of Downward Closures of Indexed Languages","display_name":"The Complexity of Downward Closures of Indexed Languages","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7167837984","doi":"https://doi.org/10.4230/lipics.lics.2026.69"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26856","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.69","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.69/LIPIcs.LICS.2026.69.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.69/LIPIcs.LICS.2026.69.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140336133","display_name":"Richard Mandel","orcid":"https://orcid.org/0009-0001-5062-0860"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mandel, Richard","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0009-0001-5062-0860","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135959496","display_name":"Corto Mascle","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mascle, Corto","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0009-0007-7976-7480","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083429244","display_name":"Georg Zetzsche","orcid":"https://orcid.org/0000-0002-6421-4388"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Zetzsche, Georg","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6421-4388","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.83190828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.47589999437332153,"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.47589999437332153,"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/T10142","display_name":"Formal Methods in Verification","score":0.3407999873161316,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.11169999837875366,"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/closure","display_name":"Closure (psychology)","score":0.5918999910354614},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5595999956130981},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48820000886917114},{"id":"https://openalex.org/keywords/semigroup","display_name":"Semigroup","score":0.4683000147342682},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4586000144481659},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.4537999927997589},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.4007999897003174},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.3433000147342682}],"concepts":[{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5918999910354614},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5595999956130981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5401999950408936},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48820000886917114},{"id":"https://openalex.org/C207405024","wikidata":"https://www.wikidata.org/wiki/Q207348","display_name":"Semigroup","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.4537999927997589},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4106000065803528},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.4007999897003174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38510000705718994},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.3391999900341034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C80191660","wikidata":"https://www.wikidata.org/wiki/Q645527","display_name":"Regular grammar","level":4,"score":0.3061999976634979},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2847000062465668},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.27390000224113464},{"id":"https://openalex.org/C94922259","wikidata":"https://www.wikidata.org/wiki/Q33215","display_name":"Constructed language","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2623000144958496}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26856","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.69","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.69/LIPIcs.LICS.2026.69.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.4230/lipics.lics.2026.69","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.lics.2026.69","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26856","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.69","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.69/LIPIcs.LICS.2026.69.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7167837984.pdf","grobid_xml":"https://content.openalex.org/works/W7167837984.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Indexed":[0],"languages":[1,29],"are":[2,26,153],"a":[3,57,70,91,101,108,143,161],"classical":[4],"notion":[5],"in":[6,14,21,129],"formal":[7],"language":[8,41,73],"theory,":[9,131],"which":[10,132],"has":[11,87],"attracted":[12],"attention":[13],"recent":[15,127],"decades":[16],"due":[17],"to":[18,55,142,155],"its":[19,50],"role":[20],"higher-order":[22],"model":[23],"checking:":[24],"They":[25],"precisely":[27],"the":[28,43,66,78,121,165],"accepted":[30],"by":[31],"order-2":[32],"pushdown":[33],"automata.":[34],"The":[35],"downward":[36,67,167],"closure":[37,68],"of":[38,45,49,69,107,138],"an":[39,157],"indexed":[40,72,158],"-":[42,52],"set":[44],"all":[46],"(scattered)":[47],"subwords":[48],"members":[51],"is":[53,61,74],"well-known":[54],"be":[56],"regular":[58],"over-approximation.":[59],"It":[60],"known":[62],"since":[63],"2015":[64],"that":[65],"given":[71],"effectively":[75],"computable.":[76],"However,":[77],"algorithm":[79],"comes":[80],"with":[81,140,149,164],"no":[82],"complexity":[83],"bounds,":[84,123],"and":[85,99,169],"it":[86],"remained":[88],"open":[89],"whether":[90],"primitive-recursive":[92],"construction":[93,106],"exists.":[94],"We":[95,113],"settle":[96],"this":[97],"question":[98],"provide":[100],"triply":[102],"(resp.":[103,110],"quadruply)":[104],"exponential":[105],"non-deterministic":[109],"deterministic)":[111],"automaton.":[112],"also":[114],"prove":[115],"(asymptotically)":[116],"matching":[117],"lower":[118],"bounds.":[119],"For":[120],"upper":[122],"we":[124,152],"rely":[125],"on":[126],"advances":[128],"semigroup":[130],"let":[133],"us":[134],"compute":[135],"bounded-size":[136],"summaries":[137],"words":[139],"respect":[141],"finite":[144],"semigroup.":[145],"By":[146],"replacing":[147],"stacks":[148],"their":[150],"summaries,":[151],"able":[154],"transform":[156],"grammar":[159],"into":[160],"context-free":[162,175],"one":[163],"same":[166],"closure,":[168],"then":[170],"apply":[171],"existing":[172],"bounds":[173],"for":[174],"grammars.":[176]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-10T00:00:00"}