Ouralgorithm uses membership and equivalence queries as in Angluin’s L* algorithm . In a partialequivalence query, we ask the teacher whether the language of a givenfinite-state automaton coincides with a counter-bounded subset of the targetlanguage . We evaluate an implementation of our algorithm on a number of randombenchmarks .

Author(s) : Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet

Links : PDF - Abstract

Code :
Coursera

Keywords : algorithm - counter - - realtime - learning -

Leave a Reply

Your email address will not be published. Required fields are marked *