{"id":"https://openalex.org/W2087579839","doi":"https://doi.org/10.2168/lmcs-4(4:16)2008","title":"On the Expressive Power of 2-Stack Visibly Pushdown Automata","display_name":"On the Expressive Power of 2-Stack Visibly Pushdown Automata","publication_year":2008,"publication_date":"2008-12-24","ids":{"openalex":"https://openalex.org/W2087579839","doi":"https://doi.org/10.2168/lmcs-4(4:16)2008","mag":"2087579839"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(4:16)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:16)2008","pdf_url":"https://lmcs.episciences.org/1101/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","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1101/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Benedikt Bollig","orcid":null},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"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"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Benedikt Bollig","raw_affiliation_strings":["LSV, ENS Cachan, CNRS -61, avenue du Prsident Wilson, 94235 Cachan Cedex, France"],"affiliations":[{"raw_affiliation_string":"LSV, ENS Cachan, CNRS -61, avenue du Prsident Wilson, 94235 Cachan Cedex, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.11966829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 4, Issue 4","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.374099999666214,"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.374099999666214,"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.3573000133037567,"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/T12029","display_name":"DNA and Biological Computing","score":0.12639999389648438,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.7910000085830688},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7390999794006348},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7213000059127808},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6955999732017517},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6229000091552734},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.5748000144958496},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.39419999718666077},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.32260000705718994}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7910000085830688},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7390999794006348},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7213000059127808},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6955999732017517},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6229000091552734},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.5748000144958496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5532000064849854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.482699990272522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4059000015258789},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32350000739097595},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.3075000047683716},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2897000014781952},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.274399995803833},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.2721000015735626},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.26899999380111694},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-4(4:16)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:16)2008","pdf_url":"https://lmcs.episciences.org/1101/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:arXiv.org:0812.2423","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0812.2423","pdf_url":"https://arxiv.org/pdf/0812.2423","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:doaj.org/article:0f3a1429a3de409d9daef5405c84cb90","is_oa":true,"landing_page_url":"https://doaj.org/article/0f3a1429a3de409d9daef5405c84cb90","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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 4, Issue 4 (2008)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(4:16)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:16)2008","pdf_url":"https://lmcs.episciences.org/1101/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":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2087579839.pdf","grobid_xml":"https://content.openalex.org/works/W2087579839.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1542543925","https://openalex.org/W1573649122","https://openalex.org/W1587173665","https://openalex.org/W1603445208","https://openalex.org/W1842117537","https://openalex.org/W1973172637","https://openalex.org/W1983682288","https://openalex.org/W2054860648","https://openalex.org/W2107398710","https://openalex.org/W2156851305","https://openalex.org/W6639537592","https://openalex.org/W6656492044","https://openalex.org/W6674898376"],"related_works":[],"abstract_inverted_index":{"Visibly":[0,24],"pushdown":[1,5,25,109,133,137,187,204],"automata":[2,6,26,51,69,110,134,138,188,205],"are":[3,70,150,189],"input-driven":[4],"that":[7,53,148,165,184],"recognize":[8],"some":[9],"non-regular":[10],"context-free":[11,62],"languages":[12],"while":[13],"preserving":[14],"the":[15,42,59,65,154,197,212],"nice":[16],"closure":[17],"and":[18,38,79,82],"decidability":[19],"properties":[20,57],"of":[21,44,61,89,107,124,157,200],"finite":[22],"automata.":[23],"with":[27,96,111,139,176],"multiple":[28,112,177],"stacks":[29,113],"have":[30,75],"been":[31],"considered":[32],"recently":[33],"by":[34,214],"La":[35],"Torre,":[36],"Madhusudan,":[37],"Parlato,":[39],"who":[40],"exploit":[41],"concept":[43],"visibility":[45],"further":[46],"to":[47,153,223],"obtain":[48],"a":[49,76,84,90,104,121],"rich":[50],"class":[52,60],"can":[54,116,219],"even":[55],"express":[56],"beyond":[58],"languages.":[63],"At":[64],"same":[66],"time,":[67],"their":[68,143],"closed":[71,191],"under":[72,192],"boolean":[73],"operations,":[74],"decidable":[77],"emptiness":[78],"inclusion":[80],"problem,":[81],"enjoy":[83],"logical":[85],"characterization":[86],"in":[87,142],"terms":[88],"monadic":[91,158,166,225],"second-order":[92,159,167,226],"logic":[93,213],"over":[94],"words":[95,175],"an":[97,171,215],"additional":[98],"nesting":[99],"structure.":[100],"These":[101],"results":[102],"require":[103],"restricted":[105],"version":[106],"visibly":[108,132,136,186,203],"whose":[114],"behavior":[115],"be":[117],"split":[118],"up":[119],"into":[120],"fixed":[122],"number":[123],"phases.":[125],"In":[126],"this":[127],"paper,":[128],"we":[129,182,195,218],"consider":[130],"2-stack":[131,185,202],"(i.e.,":[135],"two":[140],"stacks)":[141],"unrestricted":[144],"form.":[145],"We":[146],"show":[147],"they":[149],"expressively":[151],"equivalent":[152],"existential":[155,224],"fragment":[156],"logic.":[160,227],"Furthermore,":[161],"it":[162],"turns":[163],"out":[164],"quantifier":[168],"alternation":[169],"forms":[170],"infinite":[172,208],"hierarchy":[173],"wrt":[174],"nestings.":[178],"Combining":[179],"these":[180],"results,":[181],"conclude":[183],"not":[190],"complementation.":[193],"Finally,":[194],"discuss":[196],"expressive":[198],"power":[199],"B\\\"{u}chi":[201],"running":[206],"on":[207],"(nested)":[209],"words.":[210],"Extending":[211],"infinity":[216],"quantifier,":[217],"likewise":[220],"establish":[221],"equivalence":[222]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-06-24T00:00:00"}