This problem is concerned with the learnability of multiplicity automata in Angluin’s exact learning model and applications to the learnability of functions represented by small multiplicity automata. The learning model we use is the exact learning model: Let f be a target function. A learning algorithm may propose to an oracle, in each step, two kinds of queries: membership queries (MQ) and equivalence queries (EQ).
Learning automata .
BERGADANO, Francesco;
2008-01-01
Abstract
This problem is concerned with the learnability of multiplicity automata in Angluin’s exact learning model and applications to the learnability of functions represented by small multiplicity automata. The learning model we use is the exact learning model: Let f be a target function. A learning algorithm may propose to an oracle, in each step, two kinds of queries: membership queries (MQ) and equivalence queries (EQ).
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
