基于完备剩余格值逻辑的自动机和文法理论  

Automata and Grammars Theory Based on Complete Residuated Lattice-Valued Logic

作　　者：彭家寅[1] 

机构地区：[1]内江师范学院数学与信息科学学院四川省高等学校数值仿真重点实验室,内江641112

出　　处：《模式识别与人工智能》2011年第5期610-618,共9页Pattern Recognition and Artificial Intelligence

基　　金：国家自然科学基金项目(No.11071178);四川省科技厅重点科技项目(No.2006J13-035);四川省教育厅重点实验室专项项目(2006ZD050)资助

摘　　要：初步建立基于完备剩余格值逻辑自动机与文法理论的基本框架.引入l值正则文法的概念,证明了任意l值自动机识别的语言等价于某种l值正则文法所生成的语言,反之,任意l值正则文法所生成的语言等价于某种l值自动机识别的语言.获得l值自动机及被l值自动机识别的语言的连接问题刻画.特别地,建立l值和L值泵引理,并得到l值语言的判定性刻画.最后,揭示带ε移动的l值自动机与不带ε移动的l值自动机之间的两个等价关系.A fundamental framework of automata and valued logic is preliminarily established. Firstly, is proved that any l value l value regular grammar, language grammars theory based on complete residuated lattice- the concept of l value regular grammars is introduced. It recognized by l value automaton is equivalent to that generated by some and conversely, the I value language generated by any l value regular grammar is also equivalent to that recognized by some l value automaton. Afterwards, the concatenations of l value automaton and l value pumping 1emma and L language is presented. language without ε-transitions is recognized by l value automaton are depicted. In particular, the 1 value value pumping lemma are built, and then a decision characterization of l value Finally, the equivalence between the l value automata with ε-transitions and those revealed.

关 键 词：非经典逻辑 自动机 正则文法 形式语言 泵引理 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]