The equivalence problem for real-time DPDAs
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
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
On the structure of graphs in the Caucal hierarchy
Theoretical Computer Science
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The equivalence problem for t-turn dpda is co-NP
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
One-reversal counter machines and multihead automata: revisited
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Decidability of DPDA Language Equivalence via First-Order Grammars
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
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
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 5.23 |
We give a proof of decidability of the equivalence problem for deterministic pushdown automata, which simplifies that of Sénizergues (Theoret. Comput. Sci. 251 (2000) 1).