摘要
引入了完备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.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第22期39-41,45,共4页
Computer Engineering and Applications
基金
国家自然科学基金资助项目(编号:10571112)
内江师范学院重点科研资助项目(编号:06NJZ-6)
关键词
格半群
L-Fuzzy矩阵
模糊有限自动机
等价
算法
lattice-ordered monoid, L-Fuzzy matrix, fuzzy finite automata, equivalence, algorithm
