In this paper, we provide a survey of recent advances in the field "Grammatical Inference" with a particular emphasis on the results concerning the learnability of target classes represented by deterministic finite automata, context-free grammars, hidden Markov models, stochastic contextfree grammars, simple recurrent neural networks, and case-based representations. * E-mail: yasu@j.dendai.ac.jp. 03043975/97/$17.00 @ 1997-Elsevier Science B.V. All rights reserved PII so304-3975(97)00014-5 Y.

more »

... akibarai Theoretical Computer Science 185 (1997) 1545 I') unknown DFA A made by an inference algorithm: membership query and equivalence query. Angluin [9] has shown that equivalence queries compensate for the lack of representative samples, and presented an efficient inference algorithm for identifying DFAs using equivalence and membership queries.