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

基于Unsharp量子逻辑的自动机和文法理论
引用本文:彭家寅.基于Unsharp量子逻辑的自动机和文法理论[J].计算机工程与应用,2012,48(28):57-60.
作者姓名:彭家寅
作者单位:四川省高等学校数值仿真重点实验室,内江师范学院 数学与信息科学学院,四川 内江 641112
基金项目:国家自然科学基金(No.11071178);四川省科技厅重点科技项目(No.2006J13-035);四川省教育厅重点实验室专项(No.2006ZD050)
摘    要:初步建立了具有某种分配律的扩展格序效应代数和格序QMV代数这两种unsharp量子结构上的自动机与文法理论的基本框架。引入了ε-值正则文法的概念,证明了任意ε-值自动机识别的语言等价于某种ε-值正则文法所生成的语言;反之,任意ε]-值正则文法所生成的语言等价于某种ε-值自动机识别的语言。讨论了ε-值正则语言在和、连接及反转运算下的封闭性质。

关 键 词:unsharp量子逻辑  &epsilon  -值自动机&epsilon  -值正则文法  &epsilon  -值正则语言  正则算子  

Automata and grammars theory based on Unsharp quantum logic
PENG Jiayin.Automata and grammars theory based on Unsharp quantum logic[J].Computer Engineering and Applications,2012,48(28):57-60.
Authors:PENG Jiayin
Affiliation:Key Laboratory of Numerical Simulation of Sichuan Provice, School of Mathematics and Information Science, Neijiang Normal University, Neijiang, Sichuan 641112, China
Abstract:A fundamental framework of automata and grammar theory based on the two unsharp quantum structures,extended lattice ordered effect algebra and lattice ordered QMV algebra with a certain kind of distributive law,is preliminarily established in this paper.The concept of ε-valued regular grammar is introduced.It is showed that any ε-valued language recognized by ε-valued automaton is equivalent to that generated by some ε-valued regular grammar,the ε-valued language generated by any ε-valued regular grammar is also equivalent to that recognized by some ε-valued automaton.The closure properties of ε-valued language under the operations of sum,concatenation and reversal are respectively discussed.
Keywords:unsharp quantum logic  ε-valued automaton  ε-valued regular grammar  ε-valued regular language  regular operation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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