Max-Product Fuzzy Context-Free Grammar and Pushdown Automaton
-
摘要: 为了扩大现有研究的应用范围,基于最大乘积型Fuzzy文法与自动机引入了最大乘积型Fuzzy下推自动机的概念,并讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系.研究表明,当且仅当最大乘积型Fuzzy上下文无关文法产生的语言集能被最大乘积型Fuzzy下推自动机接受时,能达到自动识别最大乘积Fuzzy上下文无关语言的目的.
-
关键词:
- 最大乘积型Fuzzy /
- 上下文无关文法 /
- 最大乘积型Fuzzy下推自动机 /
- Fuzzy模式识别
Abstract: To extend the application fields of the present research,the concept of max-product fuzzy pushdown automaton was given on the basis of the study of max-product fuzzy grammars and automata,and the relationships between a max-product fuzzy context-free grammar and a max-product fuzzy pushdown automaton were investigated.The research shows that if and only if a fuzzy language is produced by a max-product fuzzy context-free grammar,it can be accepted by a max-product fuzzy pushdown automaton,so the max-product fuzzy context-free language can be recognized automatically. -
IADEH L.Fuzzy sets[J]. Inf.Control,1969(8):338-353.[2] SU Lan.Pushdown artomata accepted fuzzy context-free languages[J]. Journal of VEST of China,1992(4):187-190.[3] SU Lan,MO Zhiwen.Closure of finite-state automata languages[J]. Fuzzy Set and Systems,1995(75):393-397.[4] 莫智文,舒兰.最大乘积型Fuzzy文法与自动机[J]. 四川师范大学学报,1996(6):36-39.MO Zhiwen,SU Lan.Max-product fuzzy context-free grammar and automaton[J]. Journal of Sichuan Normal University:Natural Science,1996(6):36-39. -
点击查看大图
计量
- 文章访问数: 1255
- HTML全文浏览量: 65
- PDF下载量: 304
- 被引次数: 0
下载: