一类格值自动机的极小化  

Minimization of Lattice-valued fuzzy finite automata

作　　者：冯甄玲[1] 

机构地区：[1]陕西师范大学数学与信息科学学院

出　　处：《计算机工程与应用》2007年第34期65-70,共6页Computer Engineering and Applications

摘　　要：给出了格值自动机的同余和同态,从代数角度出发详细研究了同余和同态关系的代数性质,揭示了格值自动机的代数性质和取值格半群的紧密联系,利用同余和同态关系最终研究了格值自动机的极小化问题,在正则同余下给出了可在有限步实现具有模糊初始状态和特殊模糊终状态的自动机极小化的算法。The notion congruences and homomorphisms of Lattice-valued fuzzy finite automata is proposed,investigates some algebraic properties of congruences and homomorphisms about these automata.The main results indicate that the algebraic properties of Lattice-valued fuzzy finite automata has close connections to the algebraic properties of Lattice-ordered monoids which machines take value in.Finally studies the minimization of Lattice-valued fuzzy finite automata and provide an algorithm to achieve the minimal Lattice-valued fuzzy finite automata in virtue of regular congruence.

关 键 词：格半群 格值自动机 同余 同态 极小化 

分 类 号：O235[理学—运筹学与控制论] O153.1[理学—数学]