A Polynominal Time Incremental Algorithm for Learning DFA
ICGI, pp. 37-49, 1998.
We present an ecient incremental algorithm for learning deterministic nite state automata (DFA) from labeled examples and membership queries. This algorithm is an extension of Angluin's ID pro- cedure to an incremental framework. The learning algorithm is intermit- tently provided with labeled examples and has access to a knowledgeable te...More
PPT (Upload PPT)