首页 | 本学科首页   官方微博 | 高级检索  
     

模糊有限自动机的最小化算法优化
引用本文:张婧,张苗苗.模糊有限自动机的最小化算法优化[J].计算机应用,2008,28(12):3065-3067.
作者姓名:张婧  张苗苗
作者单位:1. 同济大学,电子与信息工程学院,上海,201804
2. 同济大学软件学院,上海,201804
摘    要:现有的模糊自动机最小化算法没有涉及到对模糊自动机状态的隶属度迁移和变化的讨论,优化的模糊自动机最小化算法弥补了这类算法的不足之处。该算法将模糊有限自动机首先转化为单个初始状态的模糊自动机,然后再将转化后的模糊自动机化简为最小模糊自动机,算法在转化过程中单独讨论了模糊自动机状态隶属度的转化方式,使得算法更加严谨和简化。

关 键 词:模糊有限自动机  模糊语言  状态最小化  模糊隶属度  状态迁移
收稿时间:2008-06-11

Optimize method of minimizing fuzzy finite automata
ZHANG Jing,ZHANG Miao-miao.Optimize method of minimizing fuzzy finite automata[J].journal of Computer Applications,2008,28(12):3065-3067.
Authors:ZHANG Jing  ZHANG Miao-miao
Affiliation:ZHANG Jing1,ZHANG Miao-miao21.College of Electronics , Information Engineering,Tongji University,Shanghai 201804,China,2.College of Software
Abstract:The existing methods of minimizing fuzzy finite automata do not discuss the transfer and change of the grade of fuzzy automata, but the problem is solved in the optimized method. Firstly, the method transferred from fuzzy finite automata to normal fuzzy automata of a single initial state, and then transferred the normal fuzzy automata into the minimum fuzzy finite automata. Moreover, how the grades of fuzzy states transferred was discussed independently in the transferring methods. Optimizing the method is to make the algorithm simpler and more precise.
Keywords:Fuzzy Finite Automata (FFA)  fuzzy language  state minimization  grade of fuzzy membership  state transition
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号