{"id":"https://openalex.org/W3158447375","doi":"https://doi.org/10.46298/lmcs-20(1:3)2024","title":"A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct","display_name":"A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct","publication_year":2024,"publication_date":"2024-01-11","ids":{"openalex":"https://openalex.org/W3158447375","doi":"https://doi.org/10.46298/lmcs-20(1:3)2024","mag":"3158447375"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-20(1:3)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(1:3)2024","pdf_url":"https://lmcs.episciences.org/12860/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":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/12860/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089838447","display_name":"Shibashis Guha","orcid":"https://orcid.org/0000-0002-9814-6651"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Shibashis Guha","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081438051","display_name":"Isma\u00ebl Jecker","orcid":"https://orcid.org/0000-0002-6527-4470"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Isma\u00ebl Jecker","raw_affiliation_strings":["Institute of Science and Technology Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039866284","display_name":"Karoliina Lehtinen","orcid":"https://orcid.org/0000-0003-1171-8790"},"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":["University of Liverpool, Liverpool, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064596121","display_name":"Mart\u00edn Zimmermann","orcid":"https://orcid.org/0000-0002-8038-2453"},"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":["university of liverpool"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"university of liverpool","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8771,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73019044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"Volume 20, 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/T10142","display_name":"Formal Methods in Verification","score":0.7268999814987183,"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.7268999814987183,"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.1671999990940094,"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.02590000070631504,"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/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8149539232254028},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7424530982971191},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7178385853767395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5940341353416443},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4961331784725189},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.47205930948257446},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4587886333465576},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.41586482524871826},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4129786193370819},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33371293544769287},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30894535779953003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28512662649154663},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2000502347946167},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.1990668773651123},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13138997554779053},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.08155488967895508},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.07896658778190613}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8149539232254028},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7424530982971191},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7178385853767395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5940341353416443},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4961331784725189},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.47205930948257446},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4587886333465576},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.41586482524871826},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4129786193370819},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33371293544769287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30894535779953003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28512662649154663},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2000502347946167},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.1990668773651123},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13138997554779053},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.08155488967895508},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.07896658778190613},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.46298/lmcs-20(1:3)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(1:3)2024","pdf_url":"https://lmcs.episciences.org/12860/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:drops-oai.dagstuhl.de:14493","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.53","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:pure.atira.dk:openaire/a389c202-828c-4303-877b-5eebb7556241","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/a389c202-828c-4303-877b-5eebb7556241","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"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":"Guha, S, Jecker, I, Lehtinen, K & Zimmermann, M 2024, 'A bit of nondeterminism makes pushdown automata expressive and succinct', Logical Methods in Computer Science, vol. 20, no. 1, 39, pp. 3:1\u20133:39. https://doi.org/10.46298/lmcs-20(1:3)2024","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:2105.02611","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.02611","pdf_url":"https://arxiv.org/pdf/2105.02611","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:HAL:hal-04281616v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04281616","pdf_url":"https://hal.science/hal-04281616/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Logical Methods in Computer Science, In press","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-03320016v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03320016","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://compose.ioc.ee/mfcs/","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:doaj.org/article:03ee626ded51408a95e4d810f7c4816d","is_oa":true,"landing_page_url":"https://doaj.org/article/03ee626ded51408a95e4d810f7c4816d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)","raw_type":"article"},{"id":"doi:10.48550/arxiv.2105.02611","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2105.02611","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"},{"id":"doi:10.4230/lipics.mfcs.2021.53","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2021.53","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.46298/lmcs-20(1:3)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(1:3)2024","pdf_url":"https://lmcs.episciences.org/12860/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":[],"awards":[{"id":"https://openalex.org/G1122748177","display_name":null,"funder_award_id":"17-EURE-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2659019386","display_name":null,"funder_award_id":"ANR-17-EURE-","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4219209643","display_name":null,"funder_award_id":"SRG/2021/000466","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"},{"id":"https://openalex.org/G6129730045","display_name":"Ing\u00e9nierie et Innovation par les sciences physiques, les savoir-faire technologiques et l'interdisciplinarit\u00e9","funder_award_id":"ANR-17-EURE-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6803667113","display_name":null,"funder_award_id":"ANR-17","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3158447375.pdf"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W1494274610","https://openalex.org/W1578332044","https://openalex.org/W1587836947","https://openalex.org/W1594196576","https://openalex.org/W1601640063","https://openalex.org/W1725438563","https://openalex.org/W1804522637","https://openalex.org/W1999147218","https://openalex.org/W2002089154","https://openalex.org/W2026606097","https://openalex.org/W2035561341","https://openalex.org/W2036383159","https://openalex.org/W2040834199","https://openalex.org/W2044854034","https://openalex.org/W2049334746","https://openalex.org/W2050612755","https://openalex.org/W2059200976","https://openalex.org/W2079567772","https://openalex.org/W2087879437","https://openalex.org/W2087904762","https://openalex.org/W2099205674","https://openalex.org/W2109486375","https://openalex.org/W2111753126","https://openalex.org/W2113004376","https://openalex.org/W2151033407","https://openalex.org/W2157017998","https://openalex.org/W2405152255","https://openalex.org/W2486526350","https://openalex.org/W2487859101","https://openalex.org/W2632078856","https://openalex.org/W2762023231","https://openalex.org/W2901103347","https://openalex.org/W2966079298","https://openalex.org/W3003895133","https://openalex.org/W3013142012","https://openalex.org/W3022006420","https://openalex.org/W3042524226","https://openalex.org/W3049414011","https://openalex.org/W3102334910","https://openalex.org/W3102720710","https://openalex.org/W3105555621","https://openalex.org/W3116624436","https://openalex.org/W3128968888","https://openalex.org/W3141621133","https://openalex.org/W3148876553","https://openalex.org/W3158447375","https://openalex.org/W4205146527","https://openalex.org/W4229670679","https://openalex.org/W4232505977","https://openalex.org/W4239753785","https://openalex.org/W4299516513","https://openalex.org/W4315691002","https://openalex.org/W4403517675","https://openalex.org/W6891605499"],"related_works":["https://openalex.org/W3193561143","https://openalex.org/W1884709457","https://openalex.org/W2512356998","https://openalex.org/W2287683845","https://openalex.org/W3006504376","https://openalex.org/W2179958148","https://openalex.org/W2952137737","https://openalex.org/W3089596161","https://openalex.org/W2142746286","https://openalex.org/W2402205231","https://openalex.org/W3146824122","https://openalex.org/W3147158980","https://openalex.org/W2061036918","https://openalex.org/W1594261562","https://openalex.org/W1523939218","https://openalex.org/W2955374611","https://openalex.org/W2950941115","https://openalex.org/W2266924268","https://openalex.org/W3196258201","https://openalex.org/W1530061721"],"abstract_inverted_index":{"We":[0,47,71,92,143,159],"study":[1,94,177],"the":[2,25,33,36,178,202,211],"expressiveness":[3],"and":[4,108,196],"succinctness":[5],"of":[6,32,35,137,180,213,218],"history-deterministic":[7],"pushdown":[8,16,45,98],"automata":[9,17,99],"(HD-PDA)":[10],"over":[11],"finite":[12],"words,":[13],"that":[14,49,74,113,161,193,197],"is,":[15],"whose":[18],"nondeterminism":[19,182,195],"can":[20,76,85,119,129],"be":[21,77,86,120,130],"resolved":[22],"based":[23],"on":[24,201],"run":[26],"constructed":[27],"so":[28],"far,":[29],"but":[30,58,166,215],"independently":[31],"remainder":[34],"input":[37],"word.":[38],"These":[39],"are":[40,141,207,224],"also":[41,93],"known":[42],"as":[43],"good-for-games":[44,157],"automata.":[46,158],"prove":[48],"HD-PDA":[50,75,146,220],"recognise":[51],"more":[52,79,88,122,132],"languages":[53,62],"than":[54,81,90,106,124,134],"deterministic":[55,125],"PDA":[56,84,148],"(DPDA)":[57],"not":[59,216],"all":[60],"context-free":[61],"(CFL).":[63],"This":[64],"class":[65],"is":[66,116,154,198],"orthogonal":[67],"to":[68,209],"unambiguous":[69],"CFL.":[70],"further":[72],"show":[73,112,160],"exponentially":[78,121,131],"succinct":[80,89,123,133],"DPDA,":[82],"while":[83,127],"double-exponentially":[87],"HD-PDA.":[91,184,219],"HDness":[95,115],"in":[96,183],"visibly":[97],"(VPA),":[100],"which":[101,110,150],"enjoy":[102],"better":[103],"closure":[104],"properties":[105],"PDA,":[107],"for":[109,149],"we":[111,169,176],"deciding":[114],"ExpTime-complete.":[117],"HD-VPA":[118],"VPA,":[126],"VPA":[128],"HD-VPA.":[135],"Both":[136],"these":[138,162],"lower":[139],"bounds":[140],"tight.":[142],"then":[144],"compare":[145],"with":[147,152,221],"composition":[151],"games":[153],"well-behaved,":[155],"i.e.":[156],"two":[163],"notions":[164],"coincide,":[165],"only":[167,199],"if":[168],"consider":[170],"potentially":[171],"infinitely":[172],"branching":[173],"games.":[174],"Finally,":[175],"complexity":[179],"resolving":[181],"Every":[185],"HDPDA":[186],"has":[187],"a":[188,191],"positional":[189],"resolver,":[190],"function":[192],"resolves":[194],"dependant":[200],"current":[203],"configuration.":[204],"Pushdown":[205],"transducers":[206],"sufficient":[208],"implement":[210],"resolvers":[212,223],"HD-VPA,":[214],"those":[217],"finite-state":[222],"determinisable.":[225]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-10T00:00:00"}