12 citations · 88 across the 34 of their papers we have counts for
1 paper · 1 filter
Jos C. M. Baeten, Bas Luttik, Tim Muller +1
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described b…