This Article 
 Bibliographic References 
 Add to: 
A New Heuristic for Inferring Regular Grammars
February 1981 (vol. 3 no. 2)
pp. 191-197
Stephen Y. Itoga, Department of Information and Computer Science, University of Hawaii, Honolulu, HI 96822.
Modifications to a grammatical inference scheme by Feldman et al. are presented. A comparison of the relative performance of the original and modified schemes is made using the complexity measures of Feldman and Wharton. The case where a complex model is used to generate the sample set is then analyzed. A set of 104 samples was found that trained the program to infer the grammar that corresponded to the original model. The results of a study of the performance of this algorithm when there is a large number of samples is then presented. The major conclusion of this study is that the modified scheme has a superior performance on small sample sets but is highly unsuitable for large ones.
Stephen Y. Itoga, "A New Heuristic for Inferring Regular Grammars," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 2, pp. 191-197, Feb. 1981, doi:10.1109/TPAMI.1981.4767078
Usage of this product signifies your acceptance of the Terms of Use.