Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. - Böhm, Stanislav; Göller, Stefan (2011)