A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Information and Computation - Special issue on EXPRESS 1997
Decidability of bisimilarity for one-counter processes
Information and Computation
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Communication and Concurrency
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing
Learning one-counter languages in polynomial time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the Computational Complexity of Verifying One-Counter Processes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
One-counter Markov decision processes
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
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
BPA bisimilarity is EXPTIME-hard
Information Processing Letters
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no @e-transitions. We study the computational complexity of the problems of equivalence and regularity (i.e. semantic finiteness) on real-time one-counter automata. The first main result shows PSPACE-completeness of bisimulation equivalence; this closes the complexity gap between decidability [23] and PSPACE-hardness [25]. The second main result shows NL-completeness of language equivalence of deterministic real-time one-counter automata; this improves the known PSPACE upper bound (indirectly shown by Valiant and Paterson [27]). Finally we prove P-completeness of the problem if a given one-counter automaton is bisimulation equivalent to a finite system, and NL-completeness of the problem if the language accepted by a given deterministic real-time one-counter automaton is regular.