Inference of finite automata using homing sequences
Ronald L. Rivest, Robert E. Schapire · 1989
We present new algorithms for inferring an unknown finite-state automaton from its input/output behavior in the absence of a means of resetting the machine to a start state. A key technique used is inference of a homing sequence for the unknown automaton.