关于属性G-(g-)量子文法与属性量子自动机

On Attributed G-(g-) Quantum Grammars and Attributed Quantum Automata

为了提高量子文法的描述能力 ,较好地克服上下文有关文法的难点 ,引入了属性G (g )量子文法、(广义 )属性量子自动机等概念 ,进而研究了它们之间的关系 ,即 :对每一给定的属性G (g )量子文法 ,F都可以构造出一个广义属性量子自动机Q ,使得它们所接受的语言集相等 ,反之亦然 .从而达到了自动识别属性G (g )

To increase depictive ability of quantum grammars and overcome difficulties in context sensitive grammars, we put forward the concepts of attributed G (g ) quantum grammars and attributed quantum automata in this paper. The relationship between them is investigated. It is proved that for a given attributed G (g ) quantum grammar G, an attributed quantum automaton Q can be produced such that f Q=f G,X , and vice versa. So attributed G (g ) quantum language can be recognized automatically.