摘要
本文首先讨论了确定的最大乘积型 Fuzzy自动机与非确定的最大乘积型 Fuzzy自动机之关系 ;其次 ,对它所生成的语言的一些常用而重要的性质进行了研究 ,证明了其语言对并、链接、闭包。
In this paper, we discuss first the relation between a determinable max product fuzzy automation and a nondeterminable max product fuzzy automation Then,the properties of max product fuzzy automation languages are studied It is proved that under the operation of union, concatenation, closure, reverse and replacement,max product fuzzy automation languages are close
出处
《内江师范学院学报》
2003年第2期12-15,共4页
Journal of Neijiang Normal University
