Decidability of DPDA language equivalence via first-order grammars

Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Volumn , Issue , 2012, Pages 415-424

  Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

deterministic pushdown automaton; first order grammar; language equivalence

Indexed keywords

DETERMINISTIC PUSHDOWN AUTOMATA; FINITE SET; FIRST-ORDER; LANGUAGE EQUIVALENCE; STIRLING; UPPER BOUND;

AUTOMATA THEORY; COMPUTER SCIENCE; EQUIVALENCE CLASSES;

COMPUTABILITY AND DECIDABILITY;

EID: 84867189042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2012.51     Document Type: Conference Paper

References (17)

1. J. Baeten, J. Bergstra, and J. Klop, "Decidability of bisimulation equivalence for processes generating context-free languages," J.ACM, vol. 40, no. 3, pp. 653-682, 1993.
2. S. Böhm and S. Goöller, "Language equivalence of deterministic real-time one-counter automata is NL-complete," in MFCS 2011, ser. LNCS, vol. 6907. Springer, 2011, pp. 194-205.
3. C. H. Broadbent, A. Carayol, C.-H. L. Ong, and O. Serre, "Recursion schemes and logical reflection," in LICS 2010. IEEE Computer Society, 2010, pp. 120-129.
4. O. Burkart, D. Caucal, F. Moller, and B. Steffen, "Verification on infinite structures," in Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, Eds. North-Holland, 2001, pp. 545-623.
5. B. Courcelle, "Recursive applicative program schemes," in Handbook of Theoretical Computer Science, vol. B, J. van Leeuwen, Ed. Elsevier, MIT Press, 1990, pp. 459-492.
6. W. Czerwiński and S. Lasota, "Fast equivalence-checking for normed context-free processes," in Proc. FSTTCS'10, ser. LIPIcs, vol. 8. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.
7. S. Ginsburg and S. A. Greibach, "Deterministic context free languages," Information and Control, vol. 9, no. 6, pp. 620-648, 1966.
8. S. Kiefer, A. S. Murawski, J. Ouaknine, B. Wachter, and J. Worrell, "On the complexity of the equivalence problem for probabilistic automata," in FoSSaCS'12, ser. LNCS, vol. 7213. Springer, 2012, pp. 467-481.
9. A. Kučera and R. Mayr, "On the complexity of checking semantic equivalences between pushdown processes and finite-state processes," Inf. Comput., vol. 208, no. 7, pp. 772-796, 2010.
10. I. Lanese, J. A. Pérez, D. Sangiorgi, and A. Schmitt, "On the expressiveness and decidability of higher-order process calculi," Inf. Comput., vol. 209, no. 2, pp. 198-226, 2011.
11. S. Salvati and I. Walukiewicz, "Krivine machines and higher-order schemes," in ICALP(2)'11, ser. LNCS, vol. 6756. Springer, 2011, pp. 162-173.
12. G. Sénizergues, "L(A)=L(B)? Decidability results from complete formal systems," Theoretical Computer Science, vol. 251, no. 1-2, pp. 1-166, 2001, (a preliminary version appeared at ICALP'97).
13. -, "L(A)=L(B)? a simplified decidability proof," Theoretical Computer Science, vol. 281, no. 1-2, pp. 555-608, 2002.
14. -, "The bisimulation problem for equational graphs of finite outdegree," SIAM J.Comput., vol. 34, no. 5, pp. 1025-1106, 2005, (a preliminary version appeared at FOCS'98).
15. G. Sénizergues, "The equivalence problem for t-turn dpda is co-NP," in ICALP'03, ser. LNCS, vol. 2719. Springer, 2003, pp. 478-489.
16. C. Stirling, "Decidability of DPDA equivalence," Theoretical Computer Science, vol. 255, no. 1-2, pp. 1-31, 2001.
17. -, "Deciding DPDA equivalence is primitive recursive," in Proc. ICALP'02, ser. LNCS, vol. 2380. Springer, 2002, pp. 821-832.