{"id":"https://openalex.org/W2247132892","doi":"https://doi.org/10.1145/2946800","title":"Index Problems for Game Automata","display_name":"Index Problems for Game Automata","publication_year":2016,"publication_date":"2016-11-02","ids":{"openalex":"https://openalex.org/W2247132892","doi":"https://doi.org/10.1145/2946800","mag":"2247132892"},"language":"en","primary_location":{"id":"doi:10.1145/2946800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2946800","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-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/A5034206752","display_name":"Alessandro Facchini","orcid":"https://orcid.org/0000-0001-7507-116X"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Alessandro Facchini","raw_affiliation_strings":["IDSIA, Switzerlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDSIA, Switzerlands","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037986297","display_name":"Filip Murlak","orcid":"https://orcid.org/0000-0003-0989-3717"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Filip Murlak","raw_affiliation_strings":["University of Warsaw, Warszawa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073562431","display_name":"Micha\u0142 Skrzypczak","orcid":"https://orcid.org/0000-0002-9647-4993"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Skrzypczak","raw_affiliation_strings":["University of Warsaw, Warszawa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7209,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73503495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"4","first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9995999932289124,"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.9977999925613403,"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.9945999979972839,"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.7313686013221741},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7222468256950378},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5857853293418884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5297454595565796},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5098435282707214},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.48675060272216797},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.48501917719841003},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4814033508300781},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.48072269558906555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47924235463142395},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.43432775139808655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3542212247848511},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24935370683670044},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.21221289038658142}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7313686013221741},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7222468256950378},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5857853293418884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5297454595565796},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5098435282707214},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.48675060272216797},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.48501917719841003},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4814033508300781},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.48072269558906555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47924235463142395},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.43432775139808655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3542212247848511},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24935370683670044},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.21221289038658142},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2946800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2946800","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.718.3383","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.3383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mimuw.edu.pl/%7Emskrzypczak/docs/sk15_index_game.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W2764080","https://openalex.org/W135426567","https://openalex.org/W140996294","https://openalex.org/W192846609","https://openalex.org/W984805233","https://openalex.org/W1504333451","https://openalex.org/W1507455665","https://openalex.org/W1521217870","https://openalex.org/W1525546443","https://openalex.org/W1528015591","https://openalex.org/W1539382740","https://openalex.org/W1549866473","https://openalex.org/W1598153029","https://openalex.org/W1604678784","https://openalex.org/W1640973035","https://openalex.org/W1820503900","https://openalex.org/W1907640525","https://openalex.org/W1929640513","https://openalex.org/W1936222984","https://openalex.org/W1945611796","https://openalex.org/W1965611063","https://openalex.org/W1984317147","https://openalex.org/W1992595180","https://openalex.org/W2004345957","https://openalex.org/W2052839514","https://openalex.org/W2062792526","https://openalex.org/W2063200174","https://openalex.org/W2074210660","https://openalex.org/W2094912129","https://openalex.org/W2095175072","https://openalex.org/W2120360673","https://openalex.org/W2126399192","https://openalex.org/W2138856440","https://openalex.org/W2160685099","https://openalex.org/W2162583406","https://openalex.org/W2166247258","https://openalex.org/W2170933628","https://openalex.org/W2171232888","https://openalex.org/W3022953501","https://openalex.org/W4206871748","https://openalex.org/W6684323382","https://openalex.org/W6983593065"],"related_works":["https://openalex.org/W185868636","https://openalex.org/W2037872771","https://openalex.org/W2462239665","https://openalex.org/W1768118166","https://openalex.org/W1987608226","https://openalex.org/W2171527505","https://openalex.org/W2950147499","https://openalex.org/W2088806988","https://openalex.org/W2124370744","https://openalex.org/W2963363665"],"abstract_inverted_index":{"For":[0],"a":[1,23,52,72,147,155],"given":[2,148],"regular":[3,76,149],"language":[4,21,150],"of":[5,15,75,90],"infinite":[6],"trees,":[7],"one":[8],"can":[9,47,84,151],"ask":[10],"about":[11],"the":[12,37,88,107,114],"minimal":[13],"number":[14],"priorities":[16],"needed":[17],"to":[18,101],"recognize":[19,102],"this":[20],"with":[22],"nondeterministic,":[24,38],"alternating,":[25,39],"or":[26],"weak":[27,41],"alternating":[28,67,108,115],"parity":[29],"automaton.":[30,157],"These":[31],"questions":[32],"are":[33,99,131],"known":[34,100],"as,":[35],"respectively,":[36],"and":[40,95],"Rabin-Mostowski":[42,109],"index":[43,110,116,129],"problems.":[44],"Whether":[45],"they":[46],"be":[48,85,152],"answered":[49],"effectively":[50],"is":[51,125,144],"long-standing":[53],"open":[54],"problem,":[55],"solved":[56],"so":[57],"far":[58],"only":[59],"for":[60,133],"languages":[61,103,134],"recognizable":[62,78,135],"by":[63,79,136,154],"deterministic":[64,91],"automata":[65,98],"(the":[66],"variant":[68],"trivializes).":[69],"We":[70],"investigate":[71],"wider":[73],"class":[74],"languages,":[77],"so-called":[80],"game":[81,137,156],"automata,":[82],"which":[83],"seen":[86],"as":[87],"closure":[89],"ones":[92],"under":[93],"complementation":[94],"composition.":[96],"Game":[97],"arbitrarily":[104],"high":[105],"in":[106],"hierarchy;":[111],"that":[112,126,142],"is,":[113],"problem":[117],"does":[118],"not":[119],"trivialize":[120],"anymore.":[121],"Our":[122],"main":[123],"contribution":[124],"all":[127],"three":[128],"problems":[130],"decidable":[132,145],"automata.":[138],"Additionally,":[139],"we":[140],"show":[141],"it":[143],"whether":[146],"recognized":[153]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}