A note on the query complexity of learning DFA
It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries for learning deterministic finite automata. First we consider two different...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1992 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/370704 |
| Acceso en línea: | https://hdl.handle.net/2117/370704 |
| Access Level: | acceso abierto |
| Palabra clave: | Computational complexity Complexitat computacional Àrees temàtiques de la UPC::Informàtica |
| Sumario: | It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries for learning deterministic finite automata. First we consider two different learning situations and show lower bounds on the query complexity of learning deterministic finite automata. We then investigate the query complexity in general setting, and show some trade-off phenomenon between the number of membership and equivalence queries. |
|---|