{"id":"https://openalex.org/W2036539537","doi":"https://doi.org/10.2168/lmcs-9(3:13)2013","title":"Reachability Problem for Weak Multi-Pushdown Automata","display_name":"Reachability Problem for Weak Multi-Pushdown Automata","publication_year":2013,"publication_date":"2013-09-11","ids":{"openalex":"https://openalex.org/W2036539537","doi":"https://doi.org/10.2168/lmcs-9(3:13)2013","mag":"2036539537"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-9(3:13)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(3:13)2013","pdf_url":"https://lmcs.episciences.org/857/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/857/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113969130","display_name":"Wojciech Czerwi\u0144ski","orcid":"https://orcid.org/0000-0002-6169-868X"},"institutions":[{"id":"https://openalex.org/I54009628","display_name":"University of Bayreuth","ror":"https://ror.org/0234wmv40","country_code":"DE","type":"education","lineage":["https://openalex.org/I54009628"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wojciech Czerwi\u0144ski","raw_affiliation_strings":["[Universitat Bayreuth]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Universitat Bayreuth]","institution_ids":["https://openalex.org/I54009628"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090589200","display_name":"Piotr Hofman","orcid":"https://orcid.org/0000-0001-9866-3723"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Hofman","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":"https://orcid.org/0000-0001-9866-3723","affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102789796","display_name":"S\u0142awomir Lasota","orcid":"https://orcid.org/0000-0001-8674-4470"},"institutions":[{"id":"https://openalex.org/I4210152232","display_name":"Institute of Informatics of the Slovak Academy of Sciences","ror":"https://ror.org/04jgqpc26","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210152232"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL","SK"],"is_corresponding":false,"raw_author_name":"S\u0141awomir Lasota","raw_affiliation_strings":["Institute of Informatics, University of Warsaw","University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw","institution_ids":["https://openalex.org/I4210152232","https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7823,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85089379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"Volume 9, Issue 3","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.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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.9904000163078308,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.828007698059082},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8260464072227478},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7186591625213623},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7068429589271545},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6051445603370667},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5933607816696167},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5204184651374817},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5108375549316406},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4638606905937195},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.45404186844825745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44786399602890015},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4260617792606354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36808931827545166},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3350854218006134},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3133805990219116},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2717670202255249},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.22719430923461914},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.11999839544296265},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09513357281684875},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.08520951867103577},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.06067219376564026}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.828007698059082},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8260464072227478},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7186591625213623},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7068429589271545},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6051445603370667},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5933607816696167},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5204184651374817},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5108375549316406},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4638606905937195},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.45404186844825745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44786399602890015},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4260617792606354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36808931827545166},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3350854218006134},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3133805990219116},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2717670202255249},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.22719430923461914},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.11999839544296265},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09513357281684875},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.08520951867103577},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.06067219376564026},{"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":5,"locations":[{"id":"doi:10.2168/lmcs-9(3:13)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(3:13)2013","pdf_url":"https://lmcs.episciences.org/857/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:1308.3996","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1308.3996","pdf_url":"https://arxiv.org/pdf/1308.3996","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:CiteSeerX.psu:10.1.1.301.1399","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.1399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mimuw.edu.pl/~sl/PAPERS/concur12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.765.8184","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.765.8184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1308.3996.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:debef986a6534760a293952080a8e2e6","is_oa":true,"landing_page_url":"https://doaj.org/article/debef986a6534760a293952080a8e2e6","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 9, Issue 3 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-9(3:13)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(3:13)2013","pdf_url":"https://lmcs.episciences.org/857/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":[{"id":"https://openalex.org/F4320322733","display_name":"Ministerstwo Edukacji i Nauki","ror":"https://ror.org/05dwvd537"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2036539537.pdf","grobid_xml":"https://content.openalex.org/works/W2036539537.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W313025167","https://openalex.org/W1493367105","https://openalex.org/W1501776715","https://openalex.org/W1505482284","https://openalex.org/W1522536236","https://openalex.org/W1529497146","https://openalex.org/W1551945645","https://openalex.org/W1554834491","https://openalex.org/W1561977254","https://openalex.org/W1580879785","https://openalex.org/W1587449012","https://openalex.org/W1589224558","https://openalex.org/W1607820520","https://openalex.org/W1673206435","https://openalex.org/W1878430332","https://openalex.org/W1911833263","https://openalex.org/W1967174286","https://openalex.org/W1982760143","https://openalex.org/W1993478572","https://openalex.org/W2000116086","https://openalex.org/W2006265470","https://openalex.org/W2021009590","https://openalex.org/W2036539537","https://openalex.org/W2044772623","https://openalex.org/W2079797513","https://openalex.org/W2083909946","https://openalex.org/W2087046173","https://openalex.org/W2103587987","https://openalex.org/W2117842469","https://openalex.org/W2178845291","https://openalex.org/W2720631021","https://openalex.org/W3101218748","https://openalex.org/W4285719527","https://openalex.org/W4301322018"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1991406344","https://openalex.org/W2067895928","https://openalex.org/W127918926","https://openalex.org/W2012479020","https://openalex.org/W2472752294","https://openalex.org/W2025957242","https://openalex.org/W2171067235","https://openalex.org/W1578195976","https://openalex.org/W2522490152"],"abstract_inverted_index":{"This":[0,66],"paper":[1],"is":[2],"about":[3],"reachability":[4,43,50,62],"analysis":[5],"in":[6],"a":[7,79],"restricted":[8],"subclass":[9],"of":[10,19,28,41,47,70,82],"multi-pushdown":[11,84],"automata.":[12,85],"We":[13,38],"assume":[14],"that":[15],"the":[16,36,42,48,53,61,68,71],"control":[17],"states":[18],"an":[20,29],"automaton":[21,30],"are":[22],"partially":[23],"ordered,":[24],"and":[25,45],"all":[26],"transitions":[27],"go":[31],"downwards":[32],"with":[33],"respect":[34],"to":[35],"order.":[37],"prove":[39],"decidability":[40],"problem,":[44],"computability":[46],"backward":[49],"set.":[51],"As":[52],"main":[54],"contribution,":[55],"we":[56],"identify":[57],"relevant":[58],"subclasses":[59],"where":[60],"problem":[63,73],"becomes":[64],"NP-complete.":[65],"matches":[67],"complexity":[69],"same":[72],"for":[74],"communication-free":[75],"vector":[76],"addition":[77],"systems,":[78],"special":[80],"case":[81],"stateless":[83]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}