Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Rivest et al. (Sun,) studied this question.
synapsesocial.com/papers/6a16c4310f965e9c137b96bb — DOI: https://doi.org/10.1145/73007.73047
Ronald L. Rivest
Massachusetts Institute of Technology
Robert E. Schapire
Australian National University
Building similarity graph...
Analyzing shared references across papers
Loading...