Definability by Weakly Deterministic Regular Expressions with Counters is Decidable
['Markus Latte', 'Matthias Niewerth']
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable