格值有限自动机等价判定算法  

Algorithm for Determining the Equivalence between Lattice-valued Finite Automata

作　　者：雷红轩[1] 盛莉[2] 

机构地区：[1]内江师范学院数学系,四川内江641112 [2]集美大学理学院数学系,厦门361021

出　　处：《计算机工程与应用》2006年第22期39-41,45,共4页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(编号:10571112);内江师范学院重点科研资助项目(编号:06NJZ-6)

摘　　要：引入了完备L-Fuzzy矩阵的概念,给出了基于格半群的模糊有限自动机的形式化定义,即完备格值有限自动机,研究了它的主要性质;给出了完备格值有限自动机的行为矩阵,从行为矩阵出发,给出了自动机状态等价和自动机等价的定义。最后,得到了该类自动机等价的判定算法。The concept of complete L-Fuzzy matrix is proposed,the definition of fuzzy finite automata based on lattice-ordered monoid is formulated,i.e,the definition of complete lattice-valued finite automata is formulated,and its main properties is studied.Behavior matrix of complete laatice-valued finite automata is given.From behavior matrix,the definition of statewise equivalence relations and automata equivalence of complete lattice-valued finite automata are stated.Finally,algorithm for determining the equivalence between lattice-valued finite automata is obtained.

关 键 词：格半群 L-Fuzzy矩阵 模糊有限自动机 等价 算法 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]