====== Talks on Learning Algorithms ======
In these talks the students present papers on learning algorithms.[[start|Back to Start page]]
----
^Title ^ Authors ^ Reference Papers ^
|Learning regular sets from queries and counterexamples	|D. Angluin	|{{:Papers:angluin87.pdf|paper}}|
|PAC learning-based verification and model synthesis	|Chen et. al.|{{:Papers:draft.pdf|paper}}|
|Learning behaviors of automata from multiplicity and equivalence queries	|F. Bergadano and S. Varricchio	|{{:Papers:learning-bergadano.pdf|paper}}|
|Learning functions represented as multiplicity automata	|Beimel et. al.|{{:Papers:learning-beimel.pdf|paper}}|
|Learning ordered binary decision diagrams	|R. Gavaldà and D. Guijarro	|{{:Papers:learning-OBDD.pdf|paper}}|
|Angluin-style learning of NFA	|Bolling et. al.	|{{:Papers:BHKL-ijcai09.pdf|paper}}|
|Learning regular automata via alternating automata	|D. Angluin, S. Eisenstat, and D. Fisman	|{{:Papers:aef-ijcai15.pdf|paper}}|
|An efficient query learning algorithm for ordered binary decision diagrams|A. Nakamura|{{:papers:learn-bdd.pdf|paper}}|