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

J4 ›› 2013, Vol. 35 ›› Issue (9): 45-50.

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

王拥兵1,张丽霞1,雷红轩2

(1.安庆师范学院数学与计算科学学院,安徽安庆 246013;2.内江师范学院数学与信息科学学院,四川内江 641112)

收稿日期:2013-04-26 修回日期:2013-07-27 出版日期:2013-09-25 发布日期:2013-09-25
基金资助:
安徽省优秀青年人才基金项目 (2011SQRL097)；安庆师范学院青年科研基金项目(KJ201214)

Deterministic regular grammars based on quantum logic

WANG Yongbing1，ZHANG Lixia1，LEI Hongxuan2

(1.School of Mathematics and Computation,Anqing Normal University,Anqing 246013;
2.School of Mathematics and Information Science,Neijiang Normal University,Neijiang 641112,China)

Received:2013-04-26 Revised:2013-07-27 Online:2013-09-25 Published:2013-09-25

摘要/Abstract

摘要：

(1.安庆师范学院数学与计算科学学院,安徽安庆 246013;2.内江师范学院数学与信息科学学院,四川内江 641112)摘要：基于量子逻辑的文法理论是量子计算模型的一个重要研究方向。给出了基于量子逻辑的确定型正则文法的概念，证明了基于量子逻辑的确定型正则文法与基于量子逻辑的确定型自动机的等价性。利用此等价性，给出了量子确定正则语言的代数刻画和层次刻画，并得到量子确定正则语言关于正则运算的封闭性。关键词：

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

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 characterizations of orthomodular latticevalued deterministic regular languages are established and the closed properties of these orthomodular latticevalued languages in details under standard operative conditions are obtained.

Key words: quantum logic;orthomodular lattice;orthomodular latticevalued deterministic regular grammas;orthomodular latticevalued deterministic regular languages

王拥兵1,张丽霞1,雷红轩2. 基于量子逻辑的确定型正则文法[J]. J4, 2013, 35(9): 45-50.

WANG Yongbing1，ZHANG Lixia1，LEI Hongxuan2. Deterministic regular grammars based on quantum logic [J]. J4, 2013, 35(9): 45-50.

[1]	韩召伟[1,2] 李永明[2]. 基于量子逻辑的下推自动机的代数刻画[J]. J4, 2008, 30(11): 72-74.
[2]	林家逖任德龙田欣刘亮. 经典逻辑门与量子逻辑门之比较[J]. J4, 2005, 27(11): 93-95.