{"id":"https://openalex.org/W3192963477","doi":"https://doi.org/10.24963/ijcai.2021/388","title":"Minimization of Limit-Average Automata","display_name":"Minimization of Limit-Average Automata","publication_year":2021,"publication_date":"2021-08-01","ids":{"openalex":"https://openalex.org/W3192963477","doi":"https://doi.org/10.24963/ijcai.2021/388","mag":"3192963477"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2021/388","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/388","pdf_url":"https://www.ijcai.org/proceedings/2021/0388.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2021/0388.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015610041","display_name":"Jakub Michaliszyn","orcid":"https://orcid.org/0000-0002-5053-0347"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jakub Michaliszyn","raw_affiliation_strings":["University of Wroclaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wroclaw","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089075636","display_name":"Jan Otop","orcid":"https://orcid.org/0000-0002-8804-8011"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jan Otop","raw_affiliation_strings":["University of Wroc\u0142aw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw","institution_ids":["https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089075636"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":0.2798,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63962553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2819","last_page":"2825"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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.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.9905999898910522,"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/automaton","display_name":"Automaton","score":0.7265300750732422},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6647001504898071},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6319468021392822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5552607178688049},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.5274810194969177},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.504226565361023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5029253363609314},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4907580316066742},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45903706550598145},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4271078109741211},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4246067702770233},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.41810351610183716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41799888014793396},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.41060370206832886},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.38440269231796265},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3508304953575134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34738272428512573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34005168080329895},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21761637926101685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06543734669685364}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7265300750732422},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6647001504898071},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6319468021392822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5552607178688049},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.5274810194969177},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.504226565361023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5029253363609314},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4907580316066742},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45903706550598145},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4271078109741211},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4246067702770233},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.41810351610183716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41799888014793396},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.41060370206832886},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.38440269231796265},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3508304953575134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34738272428512573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34005168080329895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21761637926101685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06543734669685364},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2021/388","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/388","pdf_url":"https://www.ijcai.org/proceedings/2021/0388.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2021/388","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/388","pdf_url":"https://www.ijcai.org/proceedings/2021/0388.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3192963477.pdf","grobid_xml":"https://content.openalex.org/works/W3192963477.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1482318206","https://openalex.org/W1495707445","https://openalex.org/W1534702427","https://openalex.org/W1594530072","https://openalex.org/W1605297503","https://openalex.org/W1968616712","https://openalex.org/W1989445634","https://openalex.org/W2050570613","https://openalex.org/W2052395110","https://openalex.org/W2088432971","https://openalex.org/W2294334272","https://openalex.org/W2529208763","https://openalex.org/W2535981059","https://openalex.org/W2740745789","https://openalex.org/W3090810860","https://openalex.org/W3145128584","https://openalex.org/W4244661353","https://openalex.org/W4246219036","https://openalex.org/W4256129064"],"related_works":["https://openalex.org/W2026879508","https://openalex.org/W2408583837","https://openalex.org/W1482505495","https://openalex.org/W1990283467","https://openalex.org/W2404099564","https://openalex.org/W2321527407","https://openalex.org/W186350370","https://openalex.org/W3135656023","https://openalex.org/W2042728676","https://openalex.org/W2091988401"],"abstract_inverted_index":{"LimAvg-automata":[0],"are":[1],"weighted":[2],"automata":[3],"over":[4],"infinite":[5],"words":[6,36],"that":[7],"aggregate":[8],"weights":[9],"along":[10],"runs":[11],"with":[12,115],"the":[13,22,40,65,69,104,127],"limit-average":[14],"value":[15],"function.":[16],"In":[17,53],"this":[18,44,82],"paper,":[19],"we":[20,85,108],"study":[21],"minimization":[23,88],"problem":[24],"for":[25,90],"(deterministic)":[26],"LimAvg-automata.":[27],"Our":[28],"main":[29],"contribution":[30],"is":[31],"an":[32,50,110],"equivalence":[33,41],"relation":[34,45,60],"on":[35,64,74],"characterizing":[37,57],"LimAvg-automata,":[38,91],"i.e.,":[39],"classes":[42],"of":[43,49,81,112],"correspond":[46],"to":[47,55,103,126],"states":[48],"equivalent":[51,99,125],"LimAvg-automaton.":[52],"contrast":[54],"relations":[56],"DFA,":[58],"our":[59],"depends":[61],"not":[62],"only":[63],"function":[66],"defined":[67],"by":[68],"target":[70,128],"automaton,":[71],"but":[72],"also":[73],"its":[75],"structure.":[76],"We":[77],"show":[78],"two":[79],"applications":[80],"relation.":[83],"First,":[84],"present":[86,109],"a":[87,94,123],"algorithm":[89],"which":[92,118],"returns":[93],"minimal":[95],"LimAvg-automaton":[96,124],"among":[97],"those":[98],"and":[100],"structurally":[101],"similar":[102],"input":[105],"one.":[106,129],"Second,":[107],"extension":[111],"Angluin's":[113],"L^*-algorithm":[114],"syntactic":[116],"queries,":[117],"learns":[119],"in":[120],"polynomial":[121],"time":[122]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}