Relations of Some Kinds of Lattice-valued Finite Automata
Yongming Li · Mohu xitong yu shuxue · 2005
In this paper, the definitions of the four kinds of lattice-valued finite automata and their languages are given. The equivalance of the former three kinds of lattice-valued finite automata are proved. Specially the relations between the forth and the other three forms are studied.