@inproceedings{24c1f44f1082440eacc7447547f36513,
title = "An incremental interactive algorithm for regular grammar inference",
abstract = "We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly specifies a lattice of finite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and Mc is identified by searching the version-space using membership queries. We explore the problem of regular grammar inference in a setting where positive examples are provided intermittently. We provide an incremental version of the algorithm along with a set of sufficient conditions for its convergence.",
author = "Rajesh Parekh and Vasant Honavar",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 3rd International Colloquium on Grammatical Inference, ICGI 1996 ; Conference date: 25-09-1996 Through 27-09-1996",
year = "1996",
doi = "10.1007/BFb0033358",
language = "English (US)",
isbn = "3540617787",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "238--249",
editor = "{de la Higuera}, Colin and Laurent Miclet",
booktitle = "Grammatical Inference",
address = "Germany",
}