Equivalences of pushdown systems are hard

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

Volumn 8412 LNCS, Issue , 2014, Pages 1-28

  Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; EQUIVALENCE CLASSES;

BISIMULATION EQUIVALENCES; COMPLEXITY CLASS; DETERMINISTIC PUSHDOWN AUTOMATA; FIRST-ORDER; PUSHDOWN SYSTEMS; STIRLING;

COMPUTABILITY AND DECIDABILITY;

EID: 84900554714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-54830-7_1     Document Type: Conference Paper

References (30)

1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. STOC 2004, pp. 202-211. ACM (2004)
2. Benedikt, M., Göller, S., Kiefer, S., Murawski, A.S.: Bisimilarity of pushdown automata is nonelementary. In: Proc. LICS 2013, pp. 488-498. IEEE Computer Society (2013)
3. Böhm, S., Göller, S., Jančar, P.: Equivalence of deterministic one-counter automata is NL-complete. In: Proc. STOC 2013, pp. 131-140. ACM (2013)
4. Böhm, S., Göller, S., Jančar, P.: Bisimulation equivalence and regularity for real-time one-counter automata. J. Comput. Syst. Sci. 80, 720-743 (2014), http://dx.doi.org/10.1016/j.jcss.2013.11.003
5. Broadbent, C.H., Göller, S.: On bisimilarity of higher-order pushdown automata: Undecidability at order two. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 160-172. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
6. Burkart, O., Caucal, D., Steffen, B.: An elementary bisimulation decision procedure for arbitrary context-free processes. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 423-433. Springer, Heidelberg (1995)
7. Courcelle, B.: Recursive applicative program schemes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 459-492. Elsevier, MIT Press (1990)
8. Czerwinski, W., Lasota, S.: Fast equivalence-checking for normed context-free processes. In: Proc. of FSTTCS 2010. LIPIcs, vol. 8, pp. 260-271. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
9. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson's lemma. In: Proc. LICS 2011, pp. 269-278. IEEE Computer Society (2011)
10. Friedman, E.P.: The inclusion problem for simple languages. Theor. Comput. Sci. 1(4), 297-316 (1976)
11. Göller, S., Lohrey, M.: The First-Order Theory of Ground Tree Rewrite Graphs. Logical Methods in Computer Science 10(1) (2014), http://dx.doi.org/10.2168/LMCS-10(1:7)2014
12. Henry, P., Sénizergues, G.: LALBLC A program testing the equivalence of dpda's. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 169-180. Springer, Heidelberg (2013)
13. Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theor. Comput. Sci. 158(1&2), 143-159 (1996)
14. Jančar, P., Srba, J.: Undecidability of bisimilarity by Defender's forcing. J. ACM 55(1) (2008)
15. Jančar, P.: Decidability of DPDA language equivalence via first-order grammars. In: Proc. LICS 2012, pp. 415-424. IEEE Computer Society (2012)
16. Jančar, P.: Bisimilarity on basic process algebra is in 2-ExpTime (an explicit proof). Logical Methods in Computer Science 9(1) (2013)
17. Kiefer, S.: BPA bisimilarity is EXPTIME-hard. Inf. Process. Lett. 113(4), 101-106 (2013)
18. Kučera, A., Mayr, R.: On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Inf. Comput. 208(7), 772-796 (2010)
19. Schmitz, S.: Complexity hierarchies beyond elementary. CoRR abs/1312.5686 (2013)
20. Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616-628. Springer, Heidelberg (2010)
21. Sénizergues, G.: L(A)=L(B)? Decidability results from complete formal systems. Theoretical Computer Science 251(1-2), 1-166 (2001);
22. a preliminary version appeared at Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.): ICALP 1997. LNCS, vol. 1256. Springer, Heidelberg (1997)
23. Sénizergues, G.: The bisimulation problem for equational graphs of finite out-degree. SIAM J. Comput. 34(5), 1025-1106 (2005) (a preliminary version appeared at FOCS 1998)
24. Sénizergues, G.: The equivalence problem for t-turn DPDA is co-NP. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 478-489. Springer, Heidelberg (2003)
25. Srba, J.: Roadmap of infinite results. in: Current Trends In Theoretical Computer Science, The Challenge of the New Century, vol. 2, pp. 337-350. World Scientific Publishing Co. (2004), updated version at http://users-cs.au.dk/srba/ roadmap/
26. Srba, J.: Beyond language equivalence on visibly pushdown automata. Logical Methods in Computer Science 5(1) (2009)
27. Stirling, C.: Deciding DPDA equivalence is primitive recursive. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 821-832. Springer, Heidelberg (2002)
28. Stirling, C.: Second-order simple grammars. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 509-523. Springer, Heidelberg (2006)
29. Urquhart, A.: The complexity of decision procedures in relevance logic II. J. Symb. Log. 64(4), 1774-1802 (1999)
30. Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput. 164(2), 234-263 (2001)