{"id":"https://openalex.org/W4297935192","doi":"https://doi.org/10.25596/jalc-2009-211","title":"On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata","display_name":"On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W4297935192","doi":"https://doi.org/10.25596/jalc-2009-211"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-00681253v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00681253","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235","raw_type":"Journal articles"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00681253","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083072245","display_name":"Nutan Limaye","orcid":"https://orcid.org/0000-0002-0238-1674"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Limaye, Nutan","raw_affiliation_strings":["Institute of Mathematical Sciences [Chennai]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences [Chennai]","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020709378","display_name":"Meena Mahajan","orcid":"https://orcid.org/0000-0002-9116-4398"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mahajan, Meena","raw_affiliation_strings":["Institute of Mathematical Sciences [Chennai]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences [Chennai]","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032265613","display_name":"Antoine Meyer","orcid":"https://orcid.org/0000-0003-4513-4347"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Meyer, Antoine","raw_affiliation_strings":["Laboratoire d'informatique Algorithmique : Fondements et Applications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique Algorithmique : Fondements et Applications","institution_ids":["https://openalex.org/I4210094115"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.42326153,"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/T11567","display_name":"semigroups and automata theory","score":0.4997999966144562,"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.4997999966144562,"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.3294999897480011,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.04659999907016754,"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8188351392745972},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7796176075935364},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7259228825569153},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.7068307399749756},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5834152102470398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4877239167690277},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4419832229614258},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40300413966178894},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35738420486450195},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32672399282455444},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.20353031158447266},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.12437647581100464},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.12312230467796326},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.12225750088691711},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09798648953437805},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.06041446328163147}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8188351392745972},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7796176075935364},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7259228825569153},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.7068307399749756},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5834152102470398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4877239167690277},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4419832229614258},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40300413966178894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35738420486450195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32672399282455444},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.20353031158447266},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.12437647581100464},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.12312230467796326},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.12225750088691711},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09798648953437805},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.06041446328163147},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-00681253v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00681253","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235","raw_type":"Journal articles"},{"id":"doi:10.25596/jalc-2009-211","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2009-211","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00681253v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00681253","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235","raw_type":"Journal articles"},"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1972232894","https://openalex.org/W1991406344","https://openalex.org/W2067895928","https://openalex.org/W2482236631","https://openalex.org/W2012479020","https://openalex.org/W2472752294","https://openalex.org/W127918926","https://openalex.org/W1511257926","https://openalex.org/W2522490152"],"abstract_inverted_index":{"Visibly":[0],"pushdown":[1,43,76,93,111,119,134,147],"languages":[2,6],"properly":[3,9],"generalize":[4],"regular":[5,26],"and":[7,69,149],"are":[8,136],"contained":[10],"in":[11,40,52,63],"deterministic":[12],"context-free":[13],"languages.":[14,27,112],"The":[15],"complexity":[16,107],"of":[17,25,37,74,82,90,122,143,154],"their":[18],"membership":[19,68],"problem":[20,32],"is":[21,58,157],"equivalent":[22],"to":[23,61,138],"that":[24,116,133,156],"However,":[28],"the":[29,35,67,80,88,105,131,140],"corresponding":[30],"counting":[31,50,70],"-":[33,45],"computing":[34],"number":[36],"accepting":[38],"paths":[39,51],"a":[41,53,91,99,151],"visibly":[42,75,110],"automaton":[44,94],"could":[46],"be":[47,62,96],"harder":[48,159],"than":[49,160],"non-deterministic":[54],"finite":[55,100],"automaton:":[56],"it":[57],"only":[59],"known":[60],"LogDCFL.":[64],"We":[65,84,113],"investigate":[66],"problems":[71,103,126],"for":[72,109],"generalizations":[73],"automata,":[77,148],"defined":[78],"using":[79,98],"notion":[81],"height-determinism.":[83],"show":[85],"that,":[86],"when":[87,117],"stack-height":[89],"given":[92],"can":[95],"computed":[97],"transducer,":[101],"both":[102,125],"have":[104],"same":[106],"as":[108],"also":[114],"ShOW":[115],"allowing":[118],"transducers":[120,135],"instead":[121],"finite-state":[123],"ones,":[124],"become":[127],"LogDCFL-complete;":[128],"this":[129],"uses":[130],"fact":[132],"sufficient":[137],"compute":[139],"stack":[141],"heights":[142],"all":[144],"real-time":[145],"height-deterministic":[146],"yields":[150],"candidate":[152],"arithmetization":[153],"LogDCFL":[155,161],"no":[158],"(our":[162],"main":[163],"result).":[164]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}