1 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Andreas Maletti, Daniel Quernheim
Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in…