| The Equivalence of the DFA and OFA Automate |
| |
| 作者姓名： | Li Guocai and Wang Chuanhong |
| |
| 作者单位： | Li Guocai and Wang Chuanhong(Department of Mathematics，Tianjin Normal COllege Tianjin 300202，P.R.China)Chen Lusheng(Department of Mathematics，Nankai University Tianjin 300071，P.R.China) |
| |
| 摘 要： | ＴｈｅＥｑｕｉｖａｌｅｎｃｅ ｏｆｔｈｅＰＦＡａｎｄＯＦＡＡｕｔｏｍａｔａＴｈｅＥｑｕｉｖａｌｅｎｃｅｏｆｔｈｅＰＦＡａｎｄＯＦＡＡｕｔｏｍａｔａ￥／／ＬｉＧｕｏｃａｉａｎｄＷａｎｇＣｈｕａｎｈｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，...
|
TThe Equivalence of the PFA and OFA Automata |
| |
| Li Guocai and Wang Chuanhong.The Equivalence of the DFA and OFA Automate[J].Fuzzy Systems and Mathematics,1996(3). |
| |
| Authors: | Li Guocai and Wang Chuanhong |
| |
| Abstract: | The equivalence of the PFA and OFA means that every fuzzy language recognized by a PFA can be recognized by an OFA;and vice versa.In1]and2],PFA and OFA are studied as two kinds of inequivalent fuzzy automata.In this paper,it is proved that PFA and OFA are equivalent and the class of fuzzy languages recognized by PFA(or OFA)constitute a boolean lattice. Therefore the conclusion is overthrown that the class of fuzzy languages recognized by PFA(or OFA)does not constitute a boolean lattice. |
| |
| Keywords: | Finite fuzzy automaton Pessimistic fuzzy automaton(PFA) O-plimistic fuzzy automaton(OFA) Fuzzy langange |
| 本文献已被 CNKI 等数据库收录！ |
