5 citations · 7 across the 9 of their papers we have counts for
1 paper · 2 filters
Arnaud Carayol, Philippe Duchon, Florent Koechlin +1
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which…