Stanislav Böhm, Stefan Göller. Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. In Filip Murlak, Piotr Sankowski, editors, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Volume 6907 of Lecture Notes in Computer Science, pages 194-205, Springer, 2011. [doi]
Abstract is missing.