A polynomial time incremental algorithm for learning DFA

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

Volumn 1433, Issue , 1998, Pages 37-49

  Parekh, Rajesh ^a   Nichitiu, Codrin ^b   Honavar, Vasant ^c  

^a Allstate Res and Planning Center   (United States)

^b UNIVERSITÉ DE LYON   (France)

^c Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; FINITE AUTOMATA; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

INCREMENTAL ALGORITHM; INITIAL HYPOTHESIS; MEMBERSHIP QUERY; POLYNOMIAL-TIME; TIME AND SPACE COMPLEXITY;

LEARNING ALGORITHMS;

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

References (16)

1. D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51: 76-87, 1981.
2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75: 87-106, 1987.
3. A. Biermann and J. Feldman. A survey of results in grammatical inference. In S. Watanabe, editor, Frontiers of Pattern Recognition, Academic Press, pages 31-54, 1972.
4. D. Carmel and S. Markovitch. Learning models of intelligent agents. In Proceedings of the AAAI-96 (vol. 1), AAAI Press/MIT Press, pages 62-67, 1996.
5. P. Dupont. Incremental regular inference. In L. Miclet and C. Higuera, editors, Proceedings of the Third ICGI-96, Montpellier, France, Lecture Notes in Artificial Intelligence 1147, Springer-Verlag, pages 222-237, 1996.
6. K. S. Fu and T. L. Booth. Grammatical inference: Introduction and survey (part 1). IEEE Transactions on Systems, Man and Cybernetics, 5: 85-111, 1975.
7. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37(3): 302-320, 1978.
8. P. Langley. Elements of Machine Learning. Morgan Kauffman, Palo Alto, CA, 1995.
9. L. Miclet and J. Quinqueton. Learning from examples in sequences and grammatical inference. In G. Ferrate et al, editors, Syntactic and Structural Pattern Recognition, NATO ASI Series Vol. F45, pages 153-171, 1986.
10. J. Oncina and P. García. Inferring regular languages in polynomial update time. In N. Pérez et al, editors, Pattern Recognition and Image Analysis, World Scientific, pages 49-61, 1992.
11. T. Pao and J. Carr. A solution of the syntactic induction-inference problem for regular languages. Computer Languages, 3: 53-64, 1978.
12. S. Porat and J. Feldman. Learning automata from ordered examples. Machine Learning, 7: 109-138, 1991.
13. R. G. Parekh and V. G. Honavar. An incremental interactive algorithm for regular grammar inference. In L. Miclet and C. Higuera, editors, Proceedings of the Third ICGI-96, Montpellier, France, Lecture Notes in Artificial Intelligence 1147, Springer-Verlag, pages 238-250, 1996.
14. R. G. Parekh and V. G. Honavar. Learning dfa from simple examples. In Proceedings of the Eighth International Workshop on Algorithmic Learning Theory (ALT'97), Sendai, Japan, Lecture Notes in Artificial Intelligence 1316, Springer-Verlag, pages 116-131, 1997. Also presented at theWorkshop on Grammar Inference, Automata Induction, and Language Acquisition (ICML'97), Nashville, TN. July 12, 1997.
15. R. G. Parekh and V. G. Honavar. Grammar inference, automata induction, and language acquisition. In R. Dale, H. Moisl, and H. Somers, editors, Handbook of Natural Language Processing. Marcel Dekker, 1998. (To appear).
16. L. Pitt. Inductive inference, dfas and computational complexity. In Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 397, Springer-Verlag, pages 18-44, 1989.