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]
@inproceedings{BohmG11,
title = {Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete},
author = {Stanislav Böhm and Stefan Göller},
year = {2011},
doi = {10.1007/978-3-642-22993-0_20},
url = {http://dx.doi.org/10.1007/978-3-642-22993-0_20},
tags = {completeness},
researchr = {https://researchr.org/publication/BohmG11},
cites = {0},
citedby = {0},
pages = {194-205},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
editor = {Filip Murlak and Piotr Sankowski},
volume = {6907},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22992-3},
}