Anzeige
Erschienen in:
1997 | OriginalPaper | Buchkapitel
Algorithms for Learning Finite Automata from Queries: A Unified View
verfasst von : José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
Erschienen in: Advances in Algorithms, Languages, and Complexity
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 algorithm.