{"id":"https://openalex.org/W2798623107","doi":"https://doi.org/10.1145/3209108.3209138","title":"A Simple and Optimal Complementation Algorithm for B\u00fcchi Automata","display_name":"A Simple and Optimal Complementation Algorithm for B\u00fcchi Automata","publication_year":2018,"publication_date":"2018-06-27","ids":{"openalex":"https://openalex.org/W2798623107","doi":"https://doi.org/10.1145/3209108.3209138","mag":"2798623107"},"language":"en","primary_location":{"id":"doi:10.1145/3209108.3209138","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209108.3209138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035320124","display_name":"Joel D. Allred","orcid":"https://orcid.org/0009-0006-7286-5574"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joel D. Allred","raw_affiliation_strings":["Diffblue Ltd, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Diffblue Ltd, Oxford, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037228059","display_name":"Ulrich Ultes\u2010Nitsche","orcid":"https://orcid.org/0000-0002-5835-9572"},"institutions":[{"id":"https://openalex.org/I154338468","display_name":"University of Fribourg","ror":"https://ror.org/022fs9h90","country_code":"CH","type":"education","lineage":["https://openalex.org/I154338468"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ulrich Ultes-Nitsche","raw_affiliation_strings":["University of Fribourg, Fribourg, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Fribourg, Fribourg, Switzerland","institution_ids":["https://openalex.org/I154338468"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035320124"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6155,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8519992,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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.9977999925613403,"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.7228394746780396},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6830424070358276},{"id":"https://openalex.org/keywords/complementation","display_name":"Complementation","score":0.6771974563598633},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6244196891784668},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.557945966720581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5428012609481812},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4940028786659241},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47637292742729187},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4611975848674774},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4517984092235565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3983500003814697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3886483907699585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3816011846065521}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7228394746780396},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6830424070358276},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.6771974563598633},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6244196891784668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.557945966720581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5428012609481812},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4940028786659241},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47637292742729187},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4611975848674774},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4517984092235565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3983500003814697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3886483907699585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3816011846065521},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3209108.3209138","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209108.3209138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1513569578","https://openalex.org/W1562442213","https://openalex.org/W1964626357","https://openalex.org/W2002662108","https://openalex.org/W2031592188","https://openalex.org/W2059045337","https://openalex.org/W2138856440","https://openalex.org/W2165726630","https://openalex.org/W2284937833","https://openalex.org/W2395891450","https://openalex.org/W2561675875","https://openalex.org/W2739452352","https://openalex.org/W2763823660","https://openalex.org/W2963378790","https://openalex.org/W3104076899","https://openalex.org/W4254494800"],"related_works":["https://openalex.org/W2770489137","https://openalex.org/W2790652601","https://openalex.org/W2060032524","https://openalex.org/W2100596986","https://openalex.org/W2143578569","https://openalex.org/W2164968206","https://openalex.org/W1527109760","https://openalex.org/W2538831380","https://openalex.org/W2170132780","https://openalex.org/W4242459863"],"abstract_inverted_index":{"Complementation":[0],"of":[1,17,49,87],"B\u00fcchi":[2,7,43,77],"automata":[3,8],"is":[4,67],"complex":[5],"as":[6],"in":[9,103,111],"general":[10],"are":[11,33],"nondeterministic.":[12],"A":[13],"worst-case":[14],"state-space":[15],"growth":[16],"O((0.76n)n)":[18],"cannot":[19],"be":[20,96],"avoided.":[21],"Experiments":[22],"suggest":[23],"that":[24,69],"complementation":[25,65,73],"algorithms":[26],"perform":[27],"better":[28],"on":[29,47],"average":[30],"when":[31],"they":[32],"structurally":[34],"simple.":[35],"We":[36],"present":[37],"a":[38,60,64,84,112],"simple":[39],"algorithm":[40,74,81],"for":[41,75],"complementing":[42],"automata,":[44,78],"operating":[45],"directly":[46],"subsets":[48],"states,":[50],"structured":[51],"into":[52],"state-set":[53],"tuples":[54],"(similar":[55],"to":[56,95],"slices),":[57],"and":[58,105],"producing":[59],"deterministic":[61,76],"automaton.":[62],"Then":[63],"procedure":[66],"applied":[68],"resembles":[70],"the":[71,79,108],"straightforward":[72],"latter":[80],"actually":[82],"being":[83],"special":[85],"case":[86],"our":[88,93],"construction.":[89],"Finally,":[90],"we":[91],"prove":[92],"construction":[94],"optimal,":[97],"i.e.":[98],"having":[99],"an":[100],"upper":[101],"bound":[102],"O((0.76n)n),":[104],"furthermore":[106],"calculate":[107],"0.76":[109],"factor":[110],"novel":[113],"exact":[114],"way.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}