Show simple item record

dc.contributor.authorBalcázar Navarro, José Luis
dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorGavaldà Mestre, Ricard
dc.contributor.authorWatanabe, Osamu
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationBalcazar, J. L., Diaz, J., Gavaldà, R., Watanabe, O. "Algorithms for learning finite automata from queries: a unified view". 1996.
dc.description.abstractIn 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.
dc.format.extent25 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherComputational learning
dc.subject.otherDeterministic finite automata
dc.titleAlgorithms for learning finite automata from queries: a unified view
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorBalcazar, J. L., Diaz, J., Gavaldà, R., Watanabe, O

Files in this item


This item appears in the following Collection(s)

Show simple item record

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