A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Inference of finite automata: Reducing the search space with an ordering of pairs of states
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
We investigate the set of all minimal deterministic nite automata accepting a given set of words and rejecting another given set of words. We present several criteria to order the exploration of the corresponding search space. Three criteria are shown to have a very good behavior with respect to the pruning they imply in the search space. Best results have been obtained for the pre x ordering. We have also worked on a new dynamic ordering based on an entropy computation.
doi:10.1007/bfb0026669
fatcat:6w3e3qxatvhm3aep6k4bk7k3qa