Sciweavers

CONCUR
2010
Springer
14 years 17 days ago
Bisimilarity of One-Counter Processes Is PSPACE-Complete
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
Stanislav Böhm, Stefan Göller, Petr Janc...