An incremental interactive algorithm for regular grammar inference

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1147, Issue , 1996, Pages 238-249

  Parekh, Rajesh ^a   Honavar, Vasant ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; LEARNING ALGORITHMS;

INTERACTIVE ALGORITHMS; MEMBERSHIP QUERY; POSITIVE EXAMPLES; REGULAR GRAMMAR; VERSION SPACE;

INFERENCE ENGINES;

EID: 84958968064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033358     Document Type: Conference Paper

References (19)

1. Angluin, D. A Note on the Number of Queries Needed to Identify Regular Languages. Information and control, 51. '81. pp 76-87.
2. Angluin, D. Learning Regular Sets from Queries and Counterexamples. Information and Computation, 75. '87. pp 87-106.
3. Biermann, A., and Feldman, J. A Survey of Results in Grammatical Inference. In Watanabe S. (ed), Frontiers of Pattern Recognition. Academic Press. '72. pp. 31-54.
4. Dupont, P., Miclet, L, and Vidal, E. What is the Search Space of the Regular Inference?. In Proceedings of the ICGI-94, Alicante, Spain, Sept. '94. pp. 25-37.
5. Fu, K. Syntactic Pattern Recognition and Applications. Prentice-Hall, N.J. '82.
6. Giles, C., Chen, D., Miller, H., Sun, G., and Lee, Y. Second-order Recurrent Neural Networks for Grammatical Inference. In Proceedings of the International Joint Conference on Neural Networks 91, vol. 2, pp. 273-281, July 91.
7. Harrison, M. Introduction to Switching and Automata Theory. McGraw-Hill, '65.
8. Hirsh, H. Incremental Version-Space Merging: A General Framework for Concept Learning. Kluwer Academic Publishers, '90.
9. Honavar, V. Toward Learning Systems That Integrate Different Strategies and Representations. In: Artificial Intelligence and Neural Networks: Steps toward Principled Integration. Honavar, V. & Uhr, L. (eds) New York: Academic Press, '94.
10. Hopcroft, J., and Ullman, J. Introduction to Automata Theory, Languages, and Computation. Addison. Wesley, '79.
11. Lankhorst, M. A Genetic Algorithm for Induction of Nondeterministic Pushdown Automata. University of Groningen, Computer Science Report CS-R 9502, The Netherlands. '95.
12. Miclet, L. and Quinqueton J. Learning from Examples in Sequences and Grammatical Inference. In Ferrate, G., et al (eds) Syntactic and Structural Pattern Recognition. NATO ASI Series Vol. F45, '86. pp. 153-171.
13. Mitchell, T. Generalization as search. Artificial Intelligence, 18. '82. pp 203-226.
14. Pao, T., and Cart, J. A solution of the Syntactic Induction-Inference Problem for Regular Languages. Computer Languages, Vol. 3, '78, pp. 53-64.
15. Parekh R., and Honavar, V. An Efficient Interactive Algorithm for Regular Language Learning. Computer Science TR95-0s Iowa State University, '95. (Preliminary version appeared in Proceedings of the 5th UNB AI Symposium, Fredericton, Canada, '93).
16. Parekh, R., and Honavar, V. An Incremental Interactive Algorithm for Regular Grammar Inference. Computer Science TR96-03, Iowa State University, '96.
17. Porat S., and Feldman J. Learning Automata from Ordered Examples. Machine Learning, 7, pp 109-138. '91.
18. Schapire, R., The Design and Analysis of Efficient Learning Algorithms. MIT Press, '92.
19. VanLehn, K. and Ball, W. A Version Space Approach to Learning Context-Free Grammars. Machine Learning 2, '87. pp 39-74.