基于量子逻辑的确定型正则文法  

Deterministic regular grammars based on quantum logic

作　　者：王拥兵[1] 张丽霞[1] 雷红轩[2] 

机构地区：[1]安庆师范学院数学与计算科学学院,安徽安庆246013 [2]内江师范学院数学与信息科学学院,四川内江641112

出　　处：《计算机工程与科学》2013年第9期45-50,共6页Computer Engineering & Science

基　　金：安徽省优秀青年人才基金项目(2011SQRL097);安庆师范学院青年科研基金项目(KJ201214)

摘　　要：基于量子逻辑的文法理论是量子计算模型的一个重要研究方向。给出了基于量子逻辑的确定型正则文法的概念,证明了基于量子逻辑的确定型正则文法与基于量子逻辑的确定型自动机的等价性。利用此等价性,给出了量子确定正则语言的代数刻画和层次刻画,并得到量子确定正则语言关于正则运算的封闭性。Abstract：Automata theory based on quantum logic is an important aspect of the quantum computing models. The paper introduces an orthomodular lattice-valued deterministic regular grammar, and shows the equivalence between orthomodular lattice-valued deterministic regular grammar and orthomodular lattice-valued deterministic finite automata. Based on the equivalence, some algebraic level characteriza- tions of orthomodular lattice-valued deterministic regular languages are established and the closed prop- erties of these orthomodular lattice-valued languages in details under standard operative conditions are obtained.

关 键 词：量子逻辑 正交模格 量子确定型正则文法 量子确定正则语言 

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