This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Synthesis of Finite-State Machines from Samples of Their Behavior
June 1972 (vol. 21 no. 6)
pp. 592-597
A. W. Biermann, Department of Computer and Information Science, Ohio State University, Columbus, Ohio 43210.
J. A. Feldman, Department of Computer Science, Stanford University, Stanford, Calif. 94305.
The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalence relations is modified to give a method for synthesizing machines from finite subsets of their input¿output behavior. The synthesis procedure includes a parameter that one may adjust to obtain machines that represent the desired behavior with varying degrees of accuracy and that consequently have varying complexities. We discuss some of the uses of the method, including an application to a sequential learning problem.
Citation:
A. W. Biermann, J. A. Feldman, "On the Synthesis of Finite-State Machines from Samples of Their Behavior," IEEE Transactions on Computers, vol. 21, no. 6, pp. 592-597, June 1972, doi:10.1109/TC.1972.5009015
Usage of this product signifies your acceptance of the Terms of Use.