Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Decidability of DPDA equivalence
Theoretical Computer Science
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing
The equivalence problem for t-turn dpda is co-NP
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Information and Computation
Recursion Schemes and Logical Reflection
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Krivine machines and higher-order schemes
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Simple models for recursive schemes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
LALBLC a program testing the equivalence of dpda's
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Decidability of language equivalence of deterministic pushdown automata (DPDA) was established by G. Senizergues (1997), who thus solved a famous long-standing open problem. A simplified proof, also providing a primitive recursive complexity upper bound, was given by C. Stirling (2002). In this paper, the decidability is re-proved in the framework of first-order terms and grammars (given by finite sets of root-rewriting rules). The proof is based on the abstract ideas used in the previous proofs, but the chosen framework seems to be more natural for the problem and allows a short presentation which should be transparent for a general computer science audience.