A neural network methodology for machines' class identification

1998 
Before learning a given machine coded by a set of input-output pair sequences, we are interested in identifying whether this machine is a deterministic finite state machine, and if so whether it is a definite memory machine, a finite memory machine, or has an infinite order. If the result is that it has a finite memory order, we attempt to approximate its input and output memory order. A methodology is proposed, and experiments on different machines are presented.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    4
    References
    1
    Citations
    NaN
    KQI
    []