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