Rajesh Parekh, Codrin Nichitiu, Vasant Honavar  Home/Search
Context
Related
| iastate.edu/~honavar/Papers...icgi98.ps iastate.edu/~parekh/papers/icgi98.ps enslyon.fr/pub/LIP/Ra...RR199829.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iastate.edu/~honavar/homepage (more) From: iastate.edu/~parekh/resume (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present an efficient incremental algorithm for learning deterministic finite state automata (DFA) from labeled examples and membership queries. This algorithm is an extension of Angluin's ID procedure to an incremental framework. The learning algorithm is intermittently provided with labeled examples and has access to a knowledgeable teacher capable of answering membership queries. The learner constructs an initial hypothesis from the given set of labeled examples and the teacher's... (Update)
Similar documents (at the sentence level):
24.5%: A Polynomial Time Incremental Algorithm for Regular.. - Parekh, Nichitiu.. (1997) (Correct)
6.7%: Grammar Inference, Automata Induction, and Language Acquisition - Parekh, Honavar (2000) (Correct)
Active bibliography (related documents): More All
0.5: An Incremental Interactive Algorithm for Regular Grammar.. - Rajesh Parekh (1996) (Correct)
0.2: Efficient Learning of Regular Languages Using.. - Parekh, Honavar (1993) (Correct)
0.2: Learning DFA from Simple Examples - Rajesh Parekh Rpare (1997) (Correct)
Similar documents based on text: More All
0.6: Simple DFA are Polynomially Probably Exactly Learnable from.. - Parekh, Honavar (1999) (Correct)
0.5: Constructive Neural Network Learning Algorithms for.. - Parekh, Yang, Honavar (1998) (Correct)
0.5: Data-Driven Theory Refinement Algorithms for Bioinformatics - Yang, Parekh, al. (Correct)
BibTeX entry: (Update)
@article{ parekh98polynomial,
author = "Rajesh Parekh and Codrin Nichitiu and Vasant Honavar",
title = "A Polynomial Time Incremental Algorithm for Learning {DFA}",
journal = "Lecture Notes in Computer Science",
volume = "1433",
pages = "37--??",
year = "1998",
url = "citeseer.ist.psu.edu/76343.html" }
Citations (may not include all citations):244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
127 Complexity of automaton identification from given data (context) - Gold - 1978
103 Elements of Machine Learning (context) - Langley - 1995
53 Inferring regular languages in polynomial update time (context) - Oncina, Garc'ia - 1992
38 Learning models of intelligent agents - Carmel, Markovitch - 1996
33 Learning automata from ordered examples (context) - Porat, Feldman - 1991
29 A note on the number of queries needed to identify regular l.. (context) - Angluin - 1981
22 dfas and computational complexity (context) - Pitt - 1989
16 Incremental regular inference - Dupont - 1996
12 A survey of results in grammatical inference (context) - Biermann, Feldman - 1972
12 A solution of the syntactic induction-inference problem for .. (context) - Pao, Carr - 1978
8 Learning from examples in sequences and grammatical inferenc.. (context) - Miclet, Quinqueton - 1986
7 An incremental interactive algorithm for regular grammar inf.. - Parekh, Honavar - 1996
6 IEEE Transactions on Systems (context) - Fu, Booth et al. - 1975
5 and language acquisition (context) - Parekh, Honavar et al. - 1998
Documents on the same site (http://www.cs.iastate.edu/~honavar/homepage.html): More
Spatial learning and localization in rodents: Behavioral.. - Bhatt (Correct)
Ontology-Driven Information Extraction and.. - Silvescu.. (2001) (Correct)
Grammar Inference, Automata Induction, and Language Acquisition - Parekh, Honavar (2000) (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