Parallel induction of nondeterministic finite automata revisited
Tomasz Jastrząb · AIP conference proceedings · 2017
In the paper we continue our study on the problem of the induction of minimal nondeterministic finite automata consistent with given sample. The sample is composed of a set of examples, i.e. words to be accepted by the automaton, and counterexamples, i.e. words to be rejected by the automaton. The goal of the current research is to investigate the impact of the set of final states on the quality of the induction results. The quality is expressed here by: (i) the execution times of the applied parallel algorithm, and (ii) the number of transitions in the induced automaton.