DocumentCode :
1136758
Title :
Inference of Sequential Machines from Sample Computations
Author :
Veelenturf
Author_Institution :
Department of Electrical Engineering, Twente University of Technology
Issue :
2
fYear :
1978
Firstpage :
167
Lastpage :
170
Abstract :
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.
Keywords :
Adaptive sequential machines; identification in the limit; identification on sequential machines; inductive inference; synthesis of sequential machines; Automata; Inference algorithms; Adaptive sequential machines; identification in the limit; identification on sequential machines; inductive inference; synthesis of sequential machines;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1978.1675053
Filename :
1675053
Link To Document :
بازگشت