{"id":"https://openalex.org/W2933242334","doi":"https://doi.org/10.1007/978-3-030-17127-8_11","title":"Two-Way Parikh Automata with a Visibly Pushdown Stack","display_name":"Two-Way Parikh Automata with a Visibly Pushdown Stack","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2933242334","doi":"https://doi.org/10.1007/978-3-030-17127-8_11","mag":"2933242334"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-17127-8_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17127-8_11","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_11.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_11.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030319034","display_name":"Luc Dartois","orcid":"https://orcid.org/0000-0001-9974-1922"},"institutions":[{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Luc Dartois","raw_affiliation_strings":["LACL-Universit\u00e9 Paris-Est Cr\u00e9teil, Cr\u00e9teil, France"],"affiliations":[{"raw_affiliation_string":"LACL-Universit\u00e9 Paris-Est Cr\u00e9teil, Cr\u00e9teil, France","institution_ids":["https://openalex.org/I197681013"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049821685","display_name":"Emmanuel Filiot","orcid":"https://orcid.org/0000-0002-2520-5630"},"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":"Emmanuel Filiot","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113484548","display_name":"Jean-Marc Talbot","orcid":null},"institutions":[{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Marc Talbot","raw_affiliation_strings":["LIM-Aix-Marseille Universit\u00e9, Marseille, France"],"affiliations":[{"raw_affiliation_string":"LIM-Aix-Marseille Universit\u00e9, Marseille, France","institution_ids":["https://openalex.org/I21491767"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030319034"],"corresponding_institution_ids":["https://openalex.org/I197681013"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.06371912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"189","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8223214149475098},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8199020624160767},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6952610611915588},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6764533519744873},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6415160298347473},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5672512650489807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5391168594360352},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4586101174354553},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4387335479259491},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.42689430713653564},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4174201488494873},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41697677969932556},{"id":"https://openalex.org/keywords/emptiness","display_name":"Emptiness","score":0.4108867049217224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.393718957901001},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33141595125198364},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.29750940203666687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29148638248443604},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.1545220911502838},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08381947875022888},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.08032235503196716}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8223214149475098},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8199020624160767},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6952610611915588},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6764533519744873},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6415160298347473},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5672512650489807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5391168594360352},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4586101174354553},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4387335479259491},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.42689430713653564},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4174201488494873},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41697677969932556},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.4108867049217224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.393718957901001},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33141595125198364},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.29750940203666687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29148638248443604},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.1545220911502838},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08381947875022888},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.08032235503196716},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","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/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-17127-8_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17127-8_11","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_11.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-02162279v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02162279","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":"FOSSACS 2019, Apr 2019, Pragues, Czech Republic. pp.189-206, ⟨10.1007/978-3-030-17127-8_11⟩","raw_type":"Conference papers"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/283335","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/283335","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"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":"Lecture notes in computer science","raw_type":"info:ulb-repo/semantics/openurl/article"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-17127-8_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17127-8_11","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_11.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G794676242","display_name":null,"funder_award_id":"ANR-16-CE40-0007","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/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2933242334.pdf","grobid_xml":"https://content.openalex.org/works/W2933242334.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W2436624","https://openalex.org/W42364276","https://openalex.org/W147131300","https://openalex.org/W821240578","https://openalex.org/W1551851178","https://openalex.org/W1573542260","https://openalex.org/W1590891429","https://openalex.org/W1599939219","https://openalex.org/W1608079957","https://openalex.org/W1612395604","https://openalex.org/W1623604111","https://openalex.org/W1945689202","https://openalex.org/W1976646422","https://openalex.org/W1978405212","https://openalex.org/W2023999667","https://openalex.org/W2050426366","https://openalex.org/W2054554282","https://openalex.org/W2086959507","https://openalex.org/W2088846354","https://openalex.org/W2101936540","https://openalex.org/W2106181999","https://openalex.org/W2131886132","https://openalex.org/W2157148396","https://openalex.org/W2157390113","https://openalex.org/W2182252111","https://openalex.org/W2417968307","https://openalex.org/W2604895200","https://openalex.org/W2764317813","https://openalex.org/W3022006420","https://openalex.org/W3098000419","https://openalex.org/W4235239597","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1972232894","https://openalex.org/W1991406344","https://openalex.org/W2067895928","https://openalex.org/W2171067235","https://openalex.org/W2012479020","https://openalex.org/W2472752294","https://openalex.org/W127918926","https://openalex.org/W1486486721","https://openalex.org/W4241567000"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"we":[4,43],"investigate":[5],"the":[6,9,51,55,60,65,73,87,93,101,108,113,177],"complexity":[7],"of":[8,54,110,136,149],"emptiness":[10,82],"problem":[11,62],"for":[12,167],"Parikh":[13,21,152],"automata":[14,22,25,153],"equipped":[15],"with":[16,26],"a":[17,39,79,98,133],"pushdown":[18,24,88],"stack.":[19],"Pushdown":[20],"extend":[23],"counters":[27],"which":[28,42,124,154],"can":[29,76],"only":[30,132],"be":[31],"incremented":[32],"and":[33,67,92],"an":[34,46],"acceptance":[35],"condition":[36],"given":[37],"as":[38,45],"semi-linear":[40],"set,":[41],"represent":[44],"existential":[47],"Presburger":[48],"formula":[49],"over":[50],"final":[52],"values":[53],"counters.":[56],"We":[57,96,160],"show":[58,146],"that":[59,121,147],"non-emptiness":[61,148],"both":[63],"in":[64,78,107],"deterministic":[66],"non-deterministic":[68],"cases":[69],"is":[70,90,115,130,144,157],".":[71,159],"If":[72],"input":[74,139],"head":[75],"move":[77],"two-way":[80,150],"fashion,":[81],"gets":[83],"undecidable,":[84],"even":[85],"if":[86],"stack":[89,114],"visibly":[91,151],"automaton":[94],"deterministic.":[95],"define":[97],"restriction,":[99,103],"called":[100],"single-use":[102,156],"to":[104,145,164,174],"recover":[105],"decidability":[106],"presence":[109],"two-wayness,":[111],"when":[112],"visibly.":[116],"This":[117],"syntactic":[118],"restriction":[119],"enforces":[120],"any":[122],"transition":[123],"increments":[125],"at":[126],"least":[127],"one":[128],"dimension":[129],"triggered":[131],"bounded":[134],"number":[135],"times":[137],"per":[138],"position.":[140],"Our":[141],"main":[142],"contribution":[143],"are":[155],"NExpTime-c":[158],"finally":[161],"give":[162],"applications":[163],"decision":[165],"problems":[166],"expressive":[168],"transducer":[169],"models":[170],"from":[171],"nested":[172],"words":[173],"words,":[175],"including":[176],"equivalence":[178],"problem.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}