The Community for Technology Leaders
Green Image
Issue No. 06 - June (1972 vol. 21)
ISSN: 0018-9340
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.

J. A. Feldman and A. W. Biermann, "On the Synthesis of Finite-State Machines from Samples of Their Behavior," in IEEE Transactions on Computers, vol. 21, no. , pp. 592-597, 1972.
199 ms
(Ver 3.3 (11022016))