The equivalence problem for real-time DPDAs
Journal of the ACM (JACM)
Nondeterministic space is closed under complementation
SIAM Journal on Computing
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Decidability of bisimilarity for one-counter processes
Information and Computation
L(A) = L(B)? decidability results from complete formal systems
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
Simulation and Bisimulation over One-Counter Processes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Efficient Learning of Real Time One-Counter Automata
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Deciding equivalence of deterministic one-counter automata in polynomial time with applications to learning
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Learning one-counter languages in polynomial time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Deterministic one-counter automata
Journal of Computer and System Sciences
The equivalence problem for t-turn dpda is co-NP
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Undecidability of weak bisimulation equivalence for 1-counter processes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
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
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
| Hi-index | 0.00 |
We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well.