In this survey we compare several known variants of the
algorithm for learning deterministic finite automata via
membership and equivalence queries. We believe that our
presentation makes it easier to understand what is going
on and what the differences between the various algorithms
mean. We also include the comparative analysis of the
algorithms, review some known lower bounds, prove a new one,
and discuss the question of parallelizing this sort of algorithms.
CitationBalcazar, J. L., Diaz, J., Gavaldà, R., Watanabe, O. "Algorithms for learning finite automata from queries: a unified view". 1996.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org