Stanislav Böhm, Stefan Göller, Petr Jancar
Equivalence of deterministic one-counter automata is NL-complete
STOC, 2013.
@inproceedings{STOC-2013-BohmGJ, author = "Stanislav Böhm and Stefan Göller and Petr Jancar", booktitle = "{Proceedings of the 45th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/2488608.2488626", isbn = "978-1-4503-2029-0", pages = "131--140", publisher = "{ACM}", title = "{Equivalence of deterministic one-counter automata is NL-complete}", year = 2013, }