R. Parekh and V. Honavar. Learning DFA from simple examples. Machine Learning, 44(1/2):9--35, 2001.  Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Inferring Deterministic Linear Languages - Higuera, Oncina (2002) (Correct)
Learning Regular Languages From Simple Positive Examples - Denis (2000) (6 citations) (Correct)
Query, PACS and simple-PAC Learning - Castro, Guijarro (Correct)
PAC Learning under Helpful Distributions - Denis, Gilleron (1997) (10 citations) (Correct)
Learning Regular Languages From Simple Positive Examples - Denis (1998) (6 citations) (Correct)
PAC-learnability of Probabilistic Deterministic Finite State.. - Clark, Thollard (2004) (Correct)
Probabilistic Finite-State Machines - Part II - Vidal, al. (Correct)
Query, PACS and simple-PAC Learning - Castro, Guijarro (1998) (Correct)
Learning DFA from Simple Examples - Rajesh Parekh Rpare (1997) (8 citations) Self-citation (Parekh Honavar) (Correct)
Grammar Inference, Automata Induction, and Language Acquisition - Parekh, Honavar (2000) (1 citation) Self-citation (Parekh Honavar) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC