提出格值Moore机的概念,从代数角度出发详细研究此类自动机的性质,同时研究此类自动机的同余和同态,揭示此类自动机的代数性质和取值格半群的紧密联系,最终研究格值Moore机的极小化,给出可在有限步实现极小化的算法,并从理论上证明了得到的最小化格值Moore机与原格值Moore机等价。
The notion lattice-valued Moore machine is introduced, traversing some algebraic propernes of this machine and investigate the congruences and homomorphisms of this type machine. The main results indicate that the algebraic properties of lattice-valued Moore machine has close links to the algebraic properties of lattice-ordered monoids which machines take value in. Finally, the minimization algorithm of lattice-valued Moore machines with in finite steps has been shown and the equivalence of the minimal Moore machine with the primal one is proved.