Abstract
We investigate the set of all minimal deterministic finite 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 prefix ordering. We have also worked on a new dynamic ordering based on an entropy computation.
Author supplied keywords
Cite
CITATION STYLE
Olsson, B. (1998). A host-parasite genetic algorithm for asymmetric tasks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1398, pp. 346–351). Springer Verlag. https://doi.org/10.1007/bfb0026705
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
