Learning Minimal Deterministic Automata from Inexperienced Teachers
A prominent learning algorithm is Angluin’s L ∗ algorithm, which allows to learn a minimal deterministic automaton using so-called membership and equivalence queries addressed to a teacher. In many applications, however, a teacher might be unable to answer some of the membership queries because parts of the object to learn are not completely specified, not observable, it is too expensive to resolve these queries, etc. Then, these queries may be answered inconclusively. In this paper, we survey different algorithms to learn minimal deterministic automata in this setting in a coherent fashion. Moreover, we provide modifications and improvements for these algorithms, which are enabled by recent developments.
Unable to display preview. Download preview PDF.
- 2.Angluin, D.: Negative results for equivalence queries. Machine Learning 5, 121–150 (1990)Google Scholar
- 10.Paull, M., Unger, S.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Transactions on Electronic Computers (3), 356–367 (1959)Google Scholar