@inproceedings{wdre_mfcs_2015,
title = "Definability by Weakly Deterministic Regular Expressions with Counters is Decidable",
author = "Markus Latte and Matthias Niewerth",
doi = "10.1007/978-3-662-48057-1_29",
booktitle = "Mathematical Foundations of Computer Science 2015 (Part I)",
volume = "9234",
series = "Lecture Notes in Computer Science",
editor = "Italiano, Giuseppe F. and Pighizzini, Giovanni and Sannella, Donald T.",
year = 2015,
pages = "369--381",
publisher = "Springer",
isbn = "978-3-662-48056-4 (print) and 978-3-662-48057-1 (eBook)",
note = "The final publication is available at \href{http://dx.doi.org/10.1007/978-3-662-48057-1_29}{Springer}",
}