{"id":"https://openalex.org/W2998995691","doi":"https://doi.org/10.1145/3373718.3394737","title":"Good-for-games \u03c9-Pushdown Automata","display_name":"Good-for-games \u03c9-Pushdown Automata","publication_year":2020,"publication_date":"2020-05-26","ids":{"openalex":"https://openalex.org/W2998995691","doi":"https://doi.org/10.1145/3373718.3394737","mag":"2998995691"},"language":"en","primary_location":{"id":"doi:10.1145/3373718.3394737","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3373718.3394737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th 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":null,"display_name":"Karoliina Lehtinen","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Karoliina Lehtinen","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":null,"display_name":"Martin Zimmermann","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Zimmermann","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":0.5829,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72026644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"689","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T11567","display_name":"semigroups and automata theory","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/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"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/automaton","display_name":"Automaton","score":0.6848999857902527},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.47029998898506165},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.4352000057697296},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.3711000084877014},{"id":"https://openalex.org/keywords/continuous-spatial-automaton","display_name":"Continuous spatial automaton","score":0.3422999978065491},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.3174000084400177}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6848999857902527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5860000252723694},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.47029998898506165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.460099995136261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4359999895095825},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.4352000057697296},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.3711000084877014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3578000068664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3424000144004822},{"id":"https://openalex.org/C75745568","wikidata":"https://www.wikidata.org/wiki/Q5165519","display_name":"Continuous spatial automaton","level":5,"score":0.3422999978065491},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.3174000084400177},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.30079999566078186},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3373718.3394737","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3373718.3394737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2596984845","display_name":null,"funder_award_id":"892704","funder_id":"https://openalex.org/F4320333067","funder_display_name":"Sixth Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320333067","display_name":"Sixth Framework Programme","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W128496866","https://openalex.org/W325606627","https://openalex.org/W1997093946","https://openalex.org/W2022934640","https://openalex.org/W2031129785","https://openalex.org/W2038722538","https://openalex.org/W2087879437","https://openalex.org/W2111753126","https://openalex.org/W4232505977","https://openalex.org/W6672795710"],"related_works":[],"abstract_inverted_index":{"We":[0],"introduce":[1],"good-for-games":[2],"\u03c9-pushdown":[3],"automata":[4,8,23],"(\u03c9-GFG-PDA).":[5],"These":[6],"are":[7],"whose":[9],"nondeterminism":[10],"can":[11],"be":[12,25],"resolved":[13],"based":[14],"on":[15],"the":[16],"run":[17],"constructed":[18],"thus":[19],"far.":[20],"Good-for-gameness":[21],"enables":[22],"to":[24],"composed":[26],"with":[27],"games,":[28],"trees,":[29],"and":[30],"other":[31],"automata,":[32],"applications":[33],"which":[34],"otherwise":[35],"require":[36],"deterministic":[37],"automata.":[38]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2020-01-23T00:00:00"}