{"id":"https://openalex.org/W7110802022","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.12","title":"Explorability in Pushdown Automata","display_name":"Explorability in Pushdown Automata","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110802022","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.12"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25092","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.12/LIPIcs.FSTTCS.2025.12.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.12/LIPIcs.FSTTCS.2025.12.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bedi, Ayaan","orcid":"https://orcid.org/0009-0006-1787-7476"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Bedi, Ayaan","raw_affiliation_strings":["Chennai Mathematical Institute, India"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"last","author":{"id":null,"display_name":"Lehtinen, Karoliina","orcid":"https://orcid.org/0000-0003-1171-8790"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lehtinen, Karoliina","raw_affiliation_strings":["CNRS Researcher, Aix-Marseille Universit\u00e9, LIS, France"],"affiliations":[{"raw_affiliation_string":"CNRS Researcher, Aix-Marseille Universit\u00e9, LIS, France","institution_ids":["https://openalex.org/I4210114274","https://openalex.org/I1294671590","https://openalex.org/I21491767"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I19149307"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65264472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"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.414000004529953,"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.414000004529953,"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.3125999867916107,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.1428000032901764,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7009000182151794},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.6050000190734863},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5954999923706055},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.5479000210762024},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5236999988555908},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5020999908447266},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.46540001034736633}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7009000182151794},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.6050000190734863},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5954999923706055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5529000163078308},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5479000210762024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5464000105857849},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5236999988555908},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5020999908447266},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.46540001034736633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44020000100135803},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4235000014305115},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.36039999127388},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.3409000039100647},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.29409998655319214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2824000120162964},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25092","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.12/LIPIcs.FSTTCS.2025.12.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.fsttcs.2025.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2025.12","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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25092","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.12/LIPIcs.FSTTCS.2025.12.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2230816946","display_name":"Quantitative Synthesis","funder_award_id":"ANR-23-CE48-0008","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/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110802022.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,47,101],"study":[1],"explorability,":[2,108],"a":[3,82,104,163],"measure":[4,168],"of":[5,52,65,107,112,169],"nondeterminism":[6,170],"in":[7,63],"pushdown":[8,172],"automata,":[9],"which":[10],"generalises":[11],"history-determinism.":[12],"An":[13],"automaton":[14],"is":[15,154],"k-explorable":[16],"if,":[17],"while":[18],"reading":[19],"the":[20,34,50,91,110,126,146],"input,":[21],"it":[22,45],"suffices":[23],"to":[24,39],"follow":[25],"k":[26,80],"concurrent":[27],"runs,":[28],"built":[29],"step-by-step":[30],"based":[31],"only":[32],"on":[33,116],"input":[35,117],"seen":[36],"so":[37],"far,":[38],"construct":[40],"an":[41,75],"accepting":[42],"one,":[43],"if":[44],"exists.":[46],"show":[48,120],"that":[49,121,132,145],"class":[51,86,93],"explorable":[53,133],"PDAs":[54,62,134,153],"lies":[55],"strictly":[56,83],"between":[57,149],"history-deterministic":[58,142],"and":[59,68,119,144,151,165],"fully":[60],"nondeterministic":[61,99],"terms":[64],"both":[66],"expressiveness":[67],"succinctness.":[69],"In":[70],"fact":[71],"increasing":[72],"explorability":[73,123,161],"induces":[74],"infinite":[76],"hierarchy:":[77],"each":[78],"level":[79,88],"defines":[81],"more":[84,139],"expressive":[85,96],"than":[87,97,141],"k-1,":[89],"yet":[90],"entire":[92],"remains":[94],"less":[95],"general":[98],"PDAs.":[100],"then":[102],"introduce":[103],"parameterized":[105],"notion":[106],"where":[109],"number":[111],"runs":[113],"may":[114],"depend":[115],"length,":[118],"exponential":[122],"precisely":[124],"captures":[125],"context-free":[127],"languages.":[128],"Finally,":[129],"we":[130],"prove":[131],"can":[135],"be":[136],"doubly":[137],"exponentially":[138],"succinct":[140],"ones,":[143],"succinctness":[147],"gap":[148],"deterministic":[150],"2-explorable":[152],"not":[155],"recursively":[156],"enumerable.":[157],"These":[158],"results":[159],"position":[160],"as":[162],"robust":[164],"operationally":[166],"meaningful":[167],"for":[171],"systems.":[173]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-12-10T00:00:00"}