@inproceedings{20ef9086900745418f0b4214c0953751,

title = "A polynomial time incremental algorithm for learning DFA",

abstract = "We present an efficient incremental algorithm for learning deterministic unite state automata (DFA) from labeled examples and membership queries. This algorithm is an extension of Angluin's ID procedure to an incremental framework. The learning algorithm is intermittently provided with labeled examples and has access to a knowledgeable teacher capable of answering membership queries. The learner constructs an initial hypothesis from the given set of labeled examples and the teacher's responses to membership queries. If an additional example observed by the learner is inconsistent with the current hypothesis then the hypothesis is modified minimally to make it consistent with the new example. The update procedure ensures that the modified hypothesis is consistent with all examples observed thus far. The algorithm is guaranteed to converge to a minimum state DFA corresponding to the target when the set of examples observed by the learner includes a live complete set. We prove the convergence of this algorithm and analyze its time and space complexities.",

author = "Rajesh Parekh and Codrin Nichitiu and Vasant Honavar",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 4th International Colloquium on Grammatical Inference, ICGI 1998 ; Conference date: 12-07-1998 Through 14-07-1998",

year = "1998",

doi = "10.1007/bfb0054062",

language = "English (US)",

isbn = "3540647767",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "37--49",

editor = "Vasant Honavar and Giora Slutzki",

booktitle = "Grammatical Inference - 4th International Colloquium, ICGI 1998, Proceedings",

address = "Germany",

}