Algorithms for learning finite automata from queries: a unified view
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 i...
| Autores: | , , , |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 1996 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/83120 |
| Acesso em linha: | https://hdl.handle.net/2117/83120 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Computational learning Deterministic finite automata Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | 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. |
|---|