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

最大乘积型Fuzzy上下文无关文法与下推自动机
引用本文:谢跃美,田莉萍,万会芳.最大乘积型Fuzzy上下文无关文法与下推自动机[J].西南交通大学学报,2006,41(3):341-343.
作者姓名:谢跃美  田莉萍  万会芳
作者单位:1. 成都理工大学信息管理学院,四川,成都,610059
2. 西南交通大学峨眉校区,四川,峨眉山,614202
摘    要:为了扩大现有研究的应用范围,基于最大乘积型Fuzzy文法与自动机引入了最大乘积型Fuzzy下推自动机的概念,并讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系.研究表明,当且仅当最大乘积型Fuzzy上下文无关文法产生的语言集能被最大乘积型Fuzzy下推自动机接受时,能达到自动识别最大乘积Fuzzy上下文无关语言的目的.

关 键 词:最大乘积型Fuzzy  上下文无关文法  最大乘积型Fuzzy下推自动机  Fuzzy模式识别
文章编号:0258-2724(2006)03-0341-03
收稿时间:2005-01-04
修稿时间:2005-01-04

Max-Product Fuzzy Context-Free Grammar and Pushdown Automaton
XIE Yuemei,TIAN Liping,WAN Huifang.Max-Product Fuzzy Context-Free Grammar and Pushdown Automaton[J].Journal of Southwest Jiaotong University,2006,41(3):341-343.
Authors:XIE Yuemei  TIAN Liping  WAN Huifang
Institution:1. College of Information Management, Chengdu University of Technology, Chengdu 610059, China; 2. Emei Campus, Southwest Jiaotong University, Emeishan 614202, China
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.
Keywords:max-product fuzzy  context-free grammar  max-product fuzzy pushdown automaton  fuzzy pattern recognition
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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