A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Re-describing an algorithm by Hopcroft
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An efficient incremental DFA minimization algorithm
Natural Language Engineering
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
A BDD-Like implementation of an automata package
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Hopcroft's Algorithm and Cyclic Automata
Language and Automata Theory and Applications
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, a reflection is made on an indeterminism inherent to Hopcroft’s minimization algorithm: the splitter choice. We have implemented two natural policies (FIFO and FILO) for managing the set of splitters for which we obtain the following practical results: the FILO strategy performs better than the FIFO strategy, in the case of a one letter alphabet, the practical complexity in the FILO case never exceeds a linear one and our implementation is more efficient than the minimization algorithm of the FSM tool. This implementation is being integrated in a finite automata library, the Dash library. Thus, we present an efficient manner to manipulate automata by using canonical minimal automata.