Angluin, Dana. 1982. A note on the number of queries needed to identify regular languages. Information Control, 51:76--87. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Learning from Imperfect Data in Theory and Practice - Slonim (1996) (3 citations) (Correct)
Cryptography and Machine Learning - Rivest (1993) (1 citation) (Correct)
Inferring Flow of Control in Program Synthesis by Example - Schrödl, Edelkamp (Correct)
Inductive Learning from Good Examples - Ling (1991) (8 citations) (Correct)
Learning Fallible Deterministic Finite Automata - Ron, al. (1995) (3 citations) (Correct)
On the Exact Learnability of Automata with Small Cover Time - Ron, Rubinfeld (1995) (1 citation) (Correct)
The Complexity of Learning Branches and Strategies from Queries - Ott, Stephan (1997) (Correct)
An Incremental Interactive Algorithm for Regular Grammar.. - Parekh, Honavar (1996) (3 citations) (Correct)
An Incremental Interactive Algorithm for Regular Grammar.. - Rajesh Parekh (1996) (3 citations) (Correct)
The Complexity of Learning Branches and Strategies from Queries - Ott, Stephan (1997) (Correct)
A Polynomial Time Incremental Algorithm for Learning DFA - Parekh, Nichitiu, Honavar (Correct)
On the Learnability of Infinitary Regular Sets - Maler, Pnueli (1994) (3 citations) (Correct)
Neural Network Exploration Using Optimal Experiment Design - Cohn (1994) (73 citations) (Correct)
Exactly Learning Automata with Small Cover Time - Dana Ron (1995) (5 citations) (Correct)
Learning DFA from Simple Examples - Parekh, Honavar (2001) (8 citations) (Correct)
Learning DFA from Simple Examples - Parekh, Honavar (1997) (8 citations) (Correct)
Augmented Regular Expressions: A Formalism To Describe.. - Alquézar.. (Correct)
Active Learning with Multiple Views - Muslea (2002) (4 citations) (Correct)
Online Performance-Improvement - Prasad Chalasani August (Correct)
Learning DFA from Simple Examples - Rajesh Parekh Rpare (1997) (8 citations) (Correct)
A Markov Model - For The Acquisition (2003) (Correct)
Cryptography and Machine Learning - Ronald Rivest Laboratory (1993) (1 citation) (Correct)
A Markovian Lattice Model - For The Acquisition (2003) (Correct)
Inferring Flow of Control in Program Synthesis by Example - Schrödl, Edelkamp (Correct)
Polynomial Time Learnability of Simple Deterministic.. - Yasuhiro Tajima Student (2000) Self-citation (Angluin) (Correct)
First 50 documents
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