Sciweavers

ICGI
2010
Springer
13 years 2 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
COLT
1995
Springer
13 years 8 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld