{"id":"https://openalex.org/W2769117969","doi":"https://doi.org/10.23638/lmcs-15(1:12)2019","title":"Efficient reduction of nondeterministic automata with application to language inclusion testing","display_name":"Efficient reduction of nondeterministic automata with application to language inclusion testing","publication_year":2019,"publication_date":"2019-02-13","ids":{"openalex":"https://openalex.org/W2769117969","doi":"https://doi.org/10.23638/lmcs-15(1:12)2019","mag":"2769117969"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(1:12)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:12)2019","pdf_url":"https://lmcs.episciences.org/5189/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5189/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074542253","display_name":"Lorenzo Clemente","orcid":"https://orcid.org/0000-0003-0578-9103"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lorenzo Clemente","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard Mayr","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074542253"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1999,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.49602955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 15, Issue 1","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.9994999766349792,"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.9994999766349792,"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.9991000294685364,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8210603594779968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5827206373214722},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5415421724319458},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5314556360244751},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5215166211128235},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4709286093711853},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4647141695022583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4531072974205017},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4391748607158661},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.43874409794807434},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43527692556381226},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4260137677192688},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.415443480014801},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.412134051322937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41118937730789185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40527772903442383},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.3832589089870453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3783377408981323},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3124164938926697}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8210603594779968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5827206373214722},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5415421724319458},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5314556360244751},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5215166211128235},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4709286093711853},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4647141695022583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4531072974205017},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4391748607158661},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.43874409794807434},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43527692556381226},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4260137677192688},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.415443480014801},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.412134051322937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41118937730789185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40527772903442383},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.3832589089870453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3783377408981323},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3124164938926697},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.23638/lmcs-15(1:12)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:12)2019","pdf_url":"https://lmcs.episciences.org/5189/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/c39487d1-65e3-414c-80b4-658bd6d05fcc","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/c39487d1-65e3-414c-80b4-658bd6d05fcc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Clemente, L & Mayr, R 2019, 'Efficient reduction of nondeterministic automata with application to language inclusion testing', Logical Methods in Computer Science, vol. 15, no. 1, lmcs:4108. < https://lmcs.episciences.org/5189 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1711.09946","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.09946","pdf_url":"https://arxiv.org/pdf/1711.09946","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/c39487d1-65e3-414c-80b4-658bd6d05fcc","is_oa":true,"landing_page_url":"https://lmcs.episciences.org/5189","pdf_url":"http://hdl.handle.net/20.500.11820/c39487d1-65e3-414c-80b4-658bd6d05fcc","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"","raw_type":""},{"id":"doi:10.48550/arxiv.1711.09946","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1711.09946","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(1:12)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:12)2019","pdf_url":"https://lmcs.episciences.org/5189/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2769117969.pdf","grobid_xml":"https://content.openalex.org/works/W2769117969.grobid-xml"},"referenced_works_count":61,"referenced_works":["https://openalex.org/W46737949","https://openalex.org/W108629545","https://openalex.org/W143291542","https://openalex.org/W196379136","https://openalex.org/W652339031","https://openalex.org/W1480621838","https://openalex.org/W1503973138","https://openalex.org/W1505262931","https://openalex.org/W1507116188","https://openalex.org/W1519223493","https://openalex.org/W1521923248","https://openalex.org/W1533605922","https://openalex.org/W1539432158","https://openalex.org/W1543741569","https://openalex.org/W1547562281","https://openalex.org/W1548996544","https://openalex.org/W1550751956","https://openalex.org/W1566259690","https://openalex.org/W1585581063","https://openalex.org/W1605860947","https://openalex.org/W1696271966","https://openalex.org/W1841354836","https://openalex.org/W1941150702","https://openalex.org/W1964680921","https://openalex.org/W1965244712","https://openalex.org/W1965927648","https://openalex.org/W1976773489","https://openalex.org/W1979078717","https://openalex.org/W1993129359","https://openalex.org/W1994797527","https://openalex.org/W2004683920","https://openalex.org/W2007281030","https://openalex.org/W2007464118","https://openalex.org/W2030570029","https://openalex.org/W2038651011","https://openalex.org/W2045235791","https://openalex.org/W2053490354","https://openalex.org/W2059788904","https://openalex.org/W2076334860","https://openalex.org/W2085653536","https://openalex.org/W2089003125","https://openalex.org/W2098817244","https://openalex.org/W2106388690","https://openalex.org/W2116820075","https://openalex.org/W2146706022","https://openalex.org/W2148195254","https://openalex.org/W2158095202","https://openalex.org/W2163945092","https://openalex.org/W2165726630","https://openalex.org/W2200478861","https://openalex.org/W2210656085","https://openalex.org/W2272792315","https://openalex.org/W2312425605","https://openalex.org/W2395891450","https://openalex.org/W2524261825","https://openalex.org/W2793758623","https://openalex.org/W2913376930","https://openalex.org/W2914000465","https://openalex.org/W2963179057","https://openalex.org/W2963524373","https://openalex.org/W2963581588"],"related_works":["https://openalex.org/W2085484366","https://openalex.org/W2591371812","https://openalex.org/W278676640","https://openalex.org/W1504200807","https://openalex.org/W2296061337","https://openalex.org/W2154884611","https://openalex.org/W4388327399","https://openalex.org/W1622642726","https://openalex.org/W1981914472","https://openalex.org/W1583470866"],"abstract_inverted_index":{"We":[0,181],"present":[1],"efficient":[2],"algorithms":[3,74,143,184],"to":[4,28,57,208],"reduce":[5],"the":[6,96,137,158,164,173,209],"size":[7,155,174],"of":[8,51,61,92,95,106,141,157,166,199],"nondeterministic":[9,15],"B\\&amp;quot;uchi":[10],"word":[11,17],"automata":[12,18,31,62,159,211],"(NBA)":[13],"and":[14,37,67,84,108,112,196,202,204],"finite":[16],"(NFA),":[19],"while":[20],"retaining":[21],"their":[22,206],"languages.":[23],"Additionally,":[24],"we":[25,122],"describe":[26],"methods":[27],"solve":[29],"PSPACE-complete":[30],"problems":[32],"like":[33],"language":[34],"universality,":[35],"equivalence,":[36],"inclusion":[38,117],"for":[39,70,80],"much":[40,162],"larger":[41],"instances":[42],"than":[43,177],"was":[44],"previously":[45],"possible":[46],"($\\ge":[47],"1000$":[48],"states":[49],"instead":[50],"10-100).":[52],"This":[53],"can":[54],"be":[55],"used":[56],"scale":[58],"up":[59],"applications":[60],"in":[63],"formal":[64],"verification":[65],"tools":[66],"decision":[68],"procedures":[69],"logical":[71],"theories.":[72],"The":[73,154],"are":[75,119],"based":[76,103],"on":[77,104,163,185],"new":[78],"techniques":[79,100],"removing":[81],"transitions":[82,86],"(pruning)":[83],"adding":[85],"(saturation),":[87],"as":[88,90,126],"well":[89],"extensions":[91],"classic":[93],"quotienting":[94],"state":[97],"space.":[98],"These":[99],"use":[101],"criteria":[102],"combinations":[105],"backward":[107],"forward":[109],"trace":[110,116],"inclusions":[111],"simulation":[113],"relations.":[114],"Since":[115],"relations":[118],"themselves":[120],"PSPACE-complete,":[121],"introduce":[123],"lookahead":[124],"simulations":[125],"good":[127],"polynomial":[128],"time":[129,139],"computable":[130],"approximations":[131],"thereof.":[132],"Extensive":[133],"experiments":[134],"show":[135],"that":[136],"average-case":[138],"complexity":[140,150],"our":[142,169,183],"scales":[144],"slightly":[145],"above":[146],"quadratically.":[147],"(The":[148],"space":[149],"is":[151],"worst-case":[152],"quadratic.)":[153],"reduction":[156],"depends":[160],"very":[161],"class":[165],"instances,":[167],"but":[168],"algorithm":[170],"consistently":[171],"reduces":[172],"far":[175],"more":[176],"all":[178],"previous":[179],"techniques.":[180],"tested":[182],"NBA":[186,190,201],"derived":[187,191],"from":[188,192],"LTL-formulae,":[189],"mutual":[193],"exclusion":[194],"protocols":[195],"many":[197],"classes":[198],"random":[200],"NFA,":[203],"compared":[205],"performance":[207],"well-known":[210],"tool":[212],"GOAL.":[213],"Comment:":[214],"69":[215],"pages.":[216],"arXiv":[217],"admin":[218],"note:":[219],"text":[220],"overlap":[221],"with":[222],"arXiv:1210.6624":[223]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}