Constructing algorithms of submachines of lattice-valued finite state machines
Huang Jian-ke · Computer Engineering and Applications Journal · 2010
The definition of state successor of Lattice-valued Finite State Machines(LFSM) is proposed,its properties are investigated.The concepts of lattice-valued submachines and lattice-valued proper submachines and separability based on lattice-valued submachines are put forward,some properties of lattice-valued submachines are discussed.Finally,two algorithms are aimed at constructing lattice-valued submachines,an example are presented to illustrate the performance of the algorithms.