Equivalence of deterministic one-counter automata is NL-complete

Authors:
Stanislav Böhm;Stefan Göller;Petr Jancar
Affiliations:
Technical University of Ostrava, Ostrava, Czech Rep;University of Bremen and CNRS/LIAFA, Bremen, Germany;Technical University of Ostrava, Ostrava, Czech Rep
Venue:
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Year:
2013

Citing 15
Cited 1

The equivalence problem for real-time DPDAs

Journal of the ACM (JACM)
A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science
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
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

Deciding equivalence of deterministic one-counter automata in polynomial time with applications to learning
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
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
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

Bisimulation equivalence and regularity for real-time one-counter automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic one-counter automata are inequivalent if and only if they can be distinguished by a word of length polynomial in the size of the two input automata.