We here study previous results due to Hopcroft and Almeida et al. to
propose an incremental split-based deterministic automata minimization algorithm
whose average running-time does not depend on the size of the alphabet. ...
Several methods have been developed to construct -free automata that represent a regular expression. Among the most widely known are the position automaton (Glushkov), the partial derivatives automaton (Antimirov) and the ...