Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
暂无分享,去创建一个
[1] Salvatore La Torre,et al. A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[2] Salvatore La Torre,et al. An Infinite Automaton Characterization of Double Exponential Time , 2008, CSL.
[3] Aniello Murano,et al. 2-Visibly Pushdown Automata , 2007, Developments in Language Theory.
[4] Joost Engelfriet,et al. Iterated Stack Automata and Complexity Classes , 1991, Inf. Comput..
[5] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[6] Salvatore La Torre,et al. Context-Bounded Analysis of Concurrent Queue Systems , 2008, TACAS.
[7] Luca Breveglieri,et al. Multi-Push-Down Languages and Grammars , 1996, Int. J. Found. Comput. Sci..
[8] Antoni Mazurkiewicz,et al. CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.
[9] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.