Emptiness of multi-pushdown automata is 2ETIME-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5257 LNCS, Issue , 2008, Pages 121-133

  Atig, Mohamed Faouzi ^a   Bollig, Benedikt ^b   Habermehl, Peter ^a,b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING TURING MACHINES; EMPTINESS PROBLEMS; LINEAR ORDERINGS; LOWER BOUNDS; PUSHDOWN AUTOMATON; SIMULATING; STACK OPERATIONS;

CONTROL THEORY; LINGUISTICS; ROBOTS; SET THEORY; TRANSLATION (LANGUAGES); TURING MACHINES;

AUTOMATA THEORY;

EID: 54249164224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85780-8_9     Document Type: Conference Paper

References (10)

1. Atig, M.F., Bollig, B., Habermehl, P.: Emptiness of multi-pushdown automata is 2ETIME-complete. Research Report LSV-08-16. LSV, ENS Cachan (May 2008), http://www.lsv.ens-cachan.fr/Publis/RAPPORTSiSV/PDF/rr-lsv-2008-16.pdf
2. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135-150. Springer, Heidelberg (1997)
3. Breveglieri, L., Cherubini, A., Citrini, C., Crespi Reghizzi, S.: Multi-push-down languages and grammars. International Journal of Foundations of Computer Science 7(3). 253-292 (1996)
4. Breveglieri, L., Cherubini, A., Crespo Reghizzi, S.: Personal communication
5. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114-133 (1981)
6. Engelfriet, J.: Iterated stack automata and complexity classes. Information and Computation 95(1), 21-75 (1991)
7. San Pietro, P.: Two-stack automata. Technical Report 92-073, Dipartimento di elettroniea e infonmazione, Politechnico di Milano (1992)
8. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Proceedings of LICS, pp. 161-170. IEEE, Los Alamitos (2007)
9. La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of concurrent queue systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299-314. Springer, Heidelberg (2008)
10. La Torre, S., Madhusudan, P., Parlato, G.: An infinite automaton characterization of double exponential time. In: Proceedings of CSL 2008. Springer, Heidelberg (to appear, 2008)