摘要
为了扩大现有研究的应用范围,基于最大乘积型Fuzzy文法与自动机引入了最大乘积型Fuzzy下推自动机的概念,并讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系.研究表明,当且仅当最大乘积型Fuzzy上下文无关文法产生的语言集能被最大乘积型Fuzzy下推自动机接受时,能达到自动识别最大乘积Fuzzy上下文无关语言的目的.
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.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2006年第3期341-343,共3页
Journal of Southwest Jiaotong University
