This Article 
 Bibliographic References 
 Add to: 
Inference of Sequential Machines from Sample Computations
February 1978 (vol. 27 no. 2)
pp. 167-170
L.P.J. Veelenturf, Department of Electrical Engineering, Twente University of Technology
This correspondence presents and justifies an algorithm for finding a minimal, though not a smallest, finite sequential machine with a behavior comprising a given finite sample of input-output behavior of some unknown sequential machine. When the number of states n of the machine to be identified is known and the sample contains all input-output pairs of length 2n - 1, the machine found will be equivalent to the original machine and will be minimal.
Index Terms:
synthesis of sequential machines, Adaptive sequential machines, identification in the limit, identification on sequential machines, inductive inference
L.P.J. Veelenturf, "Inference of Sequential Machines from Sample Computations," IEEE Transactions on Computers, vol. 27, no. 2, pp. 167-170, Feb. 1978, doi:10.1109/TC.1978.1675053
Usage of this product signifies your acceptance of the Terms of Use.