{"id":"https://openalex.org/W2788350744","doi":"https://doi.org/10.1142/s0129054117500332","title":"Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete","display_name":"Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2788350744","doi":"https://doi.org/10.1142/s0129054117500332","mag":"2788350744"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500332","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500332","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047278328","display_name":"Mohamed Faouzi Atig","orcid":"https://orcid.org/0000-0001-8229-3481"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Mohamed Faouzi Atig","raw_affiliation_strings":["Uppsala University, 752 36 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, 752 36 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082538918","display_name":"Benedikt Bollig","orcid":"https://orcid.org/0000-0003-0985-6115"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I29607241","display_name":"\u00c9cole Normale Sup\u00e9rieure - PSL","ror":"https://ror.org/05a0dhs15","country_code":"FR","type":"funder","lineage":["https://openalex.org/I2746051580","https://openalex.org/I29607241"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Benedikt Bollig","raw_affiliation_strings":["LSV, CNRS & ENS Paris-Saclay, France"],"affiliations":[{"raw_affiliation_string":"LSV, CNRS & ENS Paris-Saclay, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I29607241","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054351430","display_name":"Peter Habermehl","orcid":"https://orcid.org/0000-0002-7982-0946"},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Peter Habermehl","raw_affiliation_strings":["IRIF, CNRS & University Paris Diderot, France"],"affiliations":[{"raw_affiliation_string":"IRIF, CNRS & University Paris Diderot, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047278328"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":0.2271,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.59543926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":"08","first_page":"945","last_page":"975"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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.9984999895095825,"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/T12029","display_name":"DNA and Biological Computing","score":0.9977999925613403,"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/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.9168764352798462},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.9100337028503418},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8501591086387634},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6499922275543213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5969671607017517},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5778555274009705},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4928469657897949},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4916711449623108},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.45973172783851624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3578236699104309},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3186996579170227},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.29834461212158203},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19521880149841309},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.17749738693237305},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.16921088099479675},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.12521132826805115},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.11682745814323425},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.09425053000450134},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.09011596441268921},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0664617121219635}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.9168764352798462},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.9100337028503418},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8501591086387634},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6499922275543213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5969671607017517},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5778555274009705},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4928469657897949},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4916711449623108},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.45973172783851624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3578236699104309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3186996579170227},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.29834461212158203},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19521880149841309},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.17749738693237305},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.16921088099479675},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.12521132826805115},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.11682745814323425},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.09425053000450134},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.09011596441268921},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0664617121219635}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054117500332","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500332","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W58916880","https://openalex.org/W1563892973","https://openalex.org/W1992878210","https://openalex.org/W2029001691","https://openalex.org/W2100532597","https://openalex.org/W2118675136","https://openalex.org/W2131886132","https://openalex.org/W2512356998","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W392685101","https://openalex.org/W1972232894","https://openalex.org/W1486486721","https://openalex.org/W2400175085","https://openalex.org/W2047588061","https://openalex.org/W2950941115","https://openalex.org/W3104704249","https://openalex.org/W2229354094"],"abstract_inverted_index":{"We":[0,43,95],"consider":[1],"ordered":[2,98],"multi-pushdown":[3,50,99],"automata,":[4,109],"a":[5,14,19,35,64],"multi-stack":[6,107],"extension":[7],"of":[8,41,86,104,122,124],"pushdown":[9,108],"automata":[10,51,100],"that":[11,32,45],"comes":[12],"with":[13,101],"constraint":[15],"on":[16,25,38,116,127],"stack":[17,29],"operations:":[18],"pop":[20,125],"can":[21,69],"only":[22],"be":[23],"performed":[24],"the":[26,39,46,72,84,102,120],"first":[27],"non-empty":[28],"(which":[30],"implies":[31],"we":[33,68],"assume":[34],"linear":[36],"ordering":[37,115],"collection":[40],"stacks).":[42],"show":[44],"emptiness":[47],"problem":[48],"for":[49,66],"is":[52,57,75,80],"2ETIME-complete.":[53],"Containment":[54],"in":[55,92],"2ETIME":[56],"shown":[58],"by":[59,82],"translating":[60],"an":[61,87,114],"automaton":[62],"into":[63],"grammar":[65],"which":[67,110],"check":[70],"if":[71],"generated":[73],"language":[74],"empty.":[76],"The":[77],"lower":[78],"bound":[79],"established":[81],"simulating":[83],"behavior":[85],"alternating":[88],"Turing":[89],"machine":[90],"working":[91],"exponential":[93],"space.":[94],"also":[96],"compare":[97],"model":[103],"bounded-phase":[105],"(visibly)":[106],"do":[111],"not":[112],"impose":[113],"stacks,":[117],"but":[118],"restrict":[119],"number":[121],"alternations":[123],"operations":[126],"different":[128],"stacks.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}