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.
No takes yet. Share an insight, caveat, or question.
Rivest et al. (1989) studied this question.