Dana Ron, Ronitt Rubinfeld  Home/Search
Context Related
| cs.huji.ac.il/labs...covercolt95.ps.gz 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: cs.huji.ac.il/labs/learning/Pa... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present algorithms for exactly learning unknown environments that can be described by deterministic finite automata. The learner performs a walk on the target automaton, where at each step it observes the output of the state it is at, and chooses a labeled edge to traverse to the next state. We assume that the learner has no means of a reset, and we also assume that the learner does not have access to a teacher that gives it counterexamples to its hypotheses. We present two algorithms, one... (Update)
Context of citations to this paper: More
...an oracle) in the no reset case. Rivest and Schapire need an equivalence oracle for their homing sequence method, whereas Ron and Rubinfeld [RR95] do not; however, their algorithm only works for DFAs with small cover time 10 , which intuitively means that all the states in the...
Cited by: More
Passively Learning Finite Automata - Murphy (1995) (Correct)
Similar documents (at the sentence level):
53.0%: Automata Learning and its Applications - Ron (1995) (Correct)
45.0%: Exactly Learning Automata with Small Cover Time - Dana Ron (1995) (Correct)
38.0%: Exactly Learning Automata of Small Cover Time - Ron, Rubinfeld (1997) (Correct)
Active bibliography (related documents): More All
0.1: Learning Fallible Deterministic Finite Automata - Ron, al. (1995) (Correct)
0.1: Malicious Omissions and Errors in Answers to Membership.. - Martins, Sloan.. (1997) (Correct)
0.1: CLASSIC Learning - Frazier, Pitt (1991) (Correct)
Similar documents based on text: More All
0.3: The Power of Team Exploration: Two Robots Can Learn Unlabeled .. - Bender, Slonim (1995) (Correct)
0.1: Testing Parenthesis Languages - Parnas, Ron, Rubinfeld (2001) (Correct)
0.1: Efficient Learning of Typical Finite Automata from.. - Freund, Kearns, Ron, .. (1993) (Correct)
BibTeX entry: (Update)
D. Ron and R. Rubinfeld. On the exact learnability of automata with small cover time. In Proc. of the Workshop on Computational Learning Theory, 1995. http://citeseer.ist.psu.edu/ron95exact.html More
@misc{ ron95exact,
author = "D. Ron and R. Rubinfeld",
title = "the exact learnability of automata with small cover time",
text = "D. Ron and R. Rubinfeld. On the exact learnability of automata with small
cover time. In Proc. of the Workshop on Computational Learning Theory, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/ron95exact.html" }
Citations (may not include all citations):375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
144 Switching and Finite Automata Theory (context) - Kohavi - 1978
142 Learning from noisy examples (context) - Angluin, Laird - 1988
109 Inference of finite automata using homing sequences (context) - Rivest, Schapire - 1993
46 Inferring finite automata with stochastic output functions a.. - Dean, Angluin et al. - 1992
36 Efficient learning of typical finite automata from random wa.. - Freund, Kearns et al. - 1993
31 The power of team exploration: Two robots can learn unlabele.. - Bender, Slonim - 1994
29 A note on the number of queries needed to identify regular l.. (context) - Angluin - 1981
27 Learning from a consistently ignorant teacher - Frazier, Goldman et al. - 1994
11 Learning fallible finite state automata (context) - Ron, Rubinfeld - 1993
3 On learning from queries and couterexamples in the presence .. (context) - Sakakibara - 1991
1 Rivest and David Zuckermann (context) - Ronald - 1992
Documents on the same site (http://www.cs.huji.ac.il/labs/learning/Papers/): More
Agnostic Clustering of Markovian Sequences - El-Yaniv (Correct)
On the Learnability and Usage of Acyclic Probabilistic.. - Ron, Singer, Tishby (1995) (Correct)
On Randomized One-Round Communication Complexity - Kremer, Nisan, Ron (1995) (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