Algorithms for learning finite automata from queries:  a unified view

Consultar RECERCAT

Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2117/83120

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Balcázar Navarro, José Luis
dc.contributor.author	Díaz Cort, Josep
dc.contributor.author	Gavaldà Mestre, Ricard
dc.contributor.author	Watanabe, Osamu
dc.date	1996-09
dc.identifier.citation	Balcazar, J. L., Diaz, J., Gavaldà, R., Watanabe, O. "Algorithms for learning finite automata from queries: a unified view". 1996.
dc.identifier.uri	http://hdl.handle.net/2117/83120
dc.language.iso	eng
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject	Computational learning
dc.subject	Deterministic finite automata
dc.title	Algorithms for learning finite automata from queries: a unified view
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	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.

Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Watanabe, Osamu

Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, Osamu

Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, Osamu

Gavaldà Mestre, Ricard; Watanabe, Osamu

Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim

Coordinació

Patrocini