LALBLC A Program Testing the Equivalence of dpda's

We describe the program LALBLC which tests whether two deterministic pushdown automata recognize the same language.

[1]  Géraud Sénizergues,et al.  The Equivalence Problem for t-Turn DPDA Is Co-NP , 2003, ICALP.

[2]  Wojciech Rytter,et al.  Prime normal form and equivalence of simple grammars , 2006, Theor. Comput. Sci..

[3]  B. Courcelle.  Fundamental properties of infinite trees , 1983 .

[4]  Véronique Cortier,et al.  From Security Protocols to Pushdown Automata , 2013, ICALP.

[5]  Andrzej S. Murawski,et al.  Idealized Algol with Ground Recursion, and DPDA Equivalence , 2005, ICALP.

[6]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[7]  Géraud Sénizergues,et al.  Some Applications of the Decidability of DPDA's Equivalence , 2001, MCU.

[8]  Géraud Sénizergues,et al.  L(A) = L(B) ? decidability results from complete formal systems , 2001 .

[9]  Stanislav Böhm,et al.  Equivalence of deterministic one-counter automata is NL-complete , 2013, STOC '13.

[10]  Petr Jancar,et al.  Decidability of DPDA Language Equivalence via First-Order Grammars , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[11]  Piotr Sankowski,et al.  Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings , 2011, MFCS.

[12]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[13]  Géraud Sénizergues,et al.  The Bisimulation Problem for Equational Graphs of Finite Out-Degree , 2000, SIAM J. Comput..

[14]  Stanislav Böhm,et al.  Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete , 2011, MFCS.

[15]  Géraud Sénizergues,et al.  The Equivalence Problem for Deterministic Pushdown Automata is Decidable , 1997, ICALP.

[16]  Amiram Yehudai,et al.  On Equivalence of Grammars Through Transformation Trees , 1979, Theor. Comput. Sci..

[17]  V. Meitus.  The equivalence problem for real-time strict deterministic pushdown automata , 1989 .

[18]  Colin Stirling,et al.  Deciding DPDA Equivalence Is Primitive Recursive , 2002, ICALP.