Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.

Markus Latte, Matthias Niewerth

Browse the full MFCS paper archive.