13 citations · 46 across the 14 of their papers we have counts for
Showing 2011 · cs.FLShow all
2 papers · 2 filters
cs.FL2011★ 1 cited
Optimal Hyper-Minimization
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…
cs.FL2011★ 9 cited
On minimising automata with errors
Paweł Gawrychowski, Artur Jeż, Andreas Maletti
The problem of k-minimisation for a DFA M is the computation of a smallest DFA N (where the size |M| of a DFA M is the size of the domain of the transition function) such that thei…