Exactly Learning Automata of Small Cover Time


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. The learner has no means of a reset, and does not have access… (More)
DOI: 10.1023/A:1007348927491


6 Figures and Tables

Slides referencing similar topics