{"id":"https://openalex.org/W4375869944","doi":"https://doi.org/10.48550/arxiv.2305.03447","title":"Regular Methods for Operator Precedence Languages","display_name":"Regular Methods for Operator Precedence Languages","publication_year":2023,"publication_date":"2023-05-05","ids":{"openalex":"https://openalex.org/W4375869944","doi":"https://doi.org/10.48550/arxiv.2305.03447"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2305.03447","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.03447","pdf_url":"https://arxiv.org/pdf/2305.03447","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2305.03447","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080555605","display_name":"Thomas A. Henzinger","orcid":"https://orcid.org/0000-0002-2985-7724"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henzinger, Thomas A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092339752","display_name":"Pavol Kebis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kebis, Pavol","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081762569","display_name":"Nicolas Mazzocchi","orcid":"https://orcid.org/0000-0001-6425-5369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mazzocchi, Nicolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016689777","display_name":"N. Ege Sara\u00e7","orcid":"https://orcid.org/0009-0000-2866-8078"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sara\u00e7, N. Ege","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"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.9972000122070312,"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.9908999800682068,"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/antichain","display_name":"Antichain","score":0.7705574035644531},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6721211075782776},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5725899934768677},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5425366759300232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5291702747344971},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.49243196845054626},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.48867109417915344},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.4415234327316284},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4408698081970215},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.41505467891693115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3967417776584625},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3569999039173126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2983214855194092},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.24788430333137512},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2440674901008606},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.2379869520664215},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.2085772454738617},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10953769087791443}],"concepts":[{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.7705574035644531},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6721211075782776},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5725899934768677},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5425366759300232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5291702747344971},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.49243196845054626},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.48867109417915344},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.4415234327316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4408698081970215},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.41505467891693115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3967417776584625},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3569999039173126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2983214855194092},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.24788430333137512},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2440674901008606},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.2379869520664215},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.2085772454738617},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10953769087791443}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2305.03447","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.03447","pdf_url":"https://arxiv.org/pdf/2305.03447","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2305.03447","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2305.03447","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2305.03447","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.03447","pdf_url":"https://arxiv.org/pdf/2305.03447","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334763","display_name":"Leibniz-Gemeinschaft","ror":"https://ror.org/01n6r0e97"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4375869944.pdf","grobid_xml":"https://content.openalex.org/works/W4375869944.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1584306444","https://openalex.org/W1536687913","https://openalex.org/W2044199853","https://openalex.org/W2089141720","https://openalex.org/W1602383402","https://openalex.org/W2067895928","https://openalex.org/W3037972106","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W1530104041"],"abstract_inverted_index":{"The":[0],"operator":[1,109,141],"precedence":[2,36,110,142],"languages":[3,13,124],"(OPLs)":[4],"represent":[5],"the":[6,11,24,31,65,68,77,82,89,94,108,117,122,130,170,173,193,199,210,223,233],"largest":[7],"known":[8],"subclass":[9],"of":[10,26,57,67,88,91,96,116,129,172,201,209],"context-free":[12],"which":[14,29,58,168],"enjoys":[15],"all":[16],"desirable":[17],"closure":[18],"and":[19,39,44,54,79,136,155,188],"decidability":[20,25],"properties.":[21],"This":[22,112,221],"includes":[23],"language":[27,137,235],"inclusion,":[28],"is":[30,113],"ultimate":[32],"verification":[33],"problem.":[34],"Operator":[35],"grammars,":[37],"automata,":[38],"logics":[40],"have":[41],"been":[42],"investigated":[43],"used,":[45],"for":[46,81,107,121,139,176,198,213,227,238],"example,":[47],"to":[48,125],"verify":[49],"programs":[50],"with":[51],"arithmetic":[52],"expressions":[53],"exceptions":[55],"(both":[56],"are":[59,191],"deterministic":[60],"pushdown":[61,70],"but":[62],"lie":[63],"outside":[64],"scope":[66],"visibly":[69],"languages).":[71],"In":[72],"this":[73],"paper,":[74],"we":[75,132],"complete":[76],"picture":[78],"give,":[80],"first":[83,224],"time,":[84],"an":[85,148,158,229],"algebraic":[86],"characterization":[87],"class":[90],"OPLs":[92,239],"in":[93,196,240],"form":[95],"a":[97,114,164,206,217],"syntactic":[98,219],"congruence":[99],"that":[100,134,231],"has":[101],"finitely":[102],"many":[103],"equivalence":[104],"classes":[105],"exactly":[106],"languages.":[111],"generalization":[115],"celebrated":[118],"Myhill-Nerode":[119],"theorem":[120],"regular":[123],"OPLs.":[126],"As":[127],"one":[128],"consequences,":[131],"show":[133],"universality":[135],"inclusion":[138,200,236],"nondeterministic":[140],"automata":[143],"can":[144,184],"be":[145,185],"solved":[146],"by":[147,162],"antichain":[149,214,225],"algorithm.":[150],"Antichain":[151,182],"algorithms":[152,183,195,215],"avoid":[153],"determinization":[154],"complementation":[156],"through":[157],"explicit":[159],"subset":[160],"construction,":[161],"leveraging":[163],"quasi-order":[165,211],"on":[166],"words,":[167],"allows":[169],"pruning":[171],"search":[174],"space":[175],"counterexample":[177],"words":[178],"without":[179],"sacrificing":[180],"completeness.":[181],"implemented":[186],"symbolically,":[187],"these":[189],"implementations":[190],"today":[192],"best-performing":[194],"practice":[197],"finite":[202,218],"automata.":[203],"We":[204],"give":[205],"generic":[207],"construction":[208],"needed":[212],"from":[216],"congruence.":[220],"yields":[222],"algorithm":[226,230],"OPLs,":[228],"solves":[232],"\\textsc{ExpTime}-hard":[234],"problem":[237],"exponential":[241],"time.":[242]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}