In these talks the students present papers on learning algorithms.Back to Start page
Title | Authors | Reference Papers |
---|---|---|
Learning regular sets from queries and counterexamples | D. Angluin | paper |
PAC learning-based verification and model synthesis | Chen et. al. | paper |
Learning behaviors of automata from multiplicity and equivalence queries | F. Bergadano and S. Varricchio | paper |
Learning functions represented as multiplicity automata | Beimel et. al. | paper |
Learning ordered binary decision diagrams | R. Gavaldà and D. Guijarro | paper |
Angluin-style learning of NFA | Bolling et. al. | paper |
Learning regular automata via alternating automata | D. Angluin, S. Eisenstat, and D. Fisman | paper |
An efficient query learning algorithm for ordered binary decision diagrams | A. Nakamura | paper |