Grammar theory based on quantum logic (Q1421575): Difference between revisions

Let \(L\) be an orthomodular lattice. The \(L\)-valued quantum automaton has been established by \textit{M. S. Ying} in [Int. J. Theor. Phys. 39, No. 4, 985--995 (2000; Zbl 0962.03029)]. Its basic ingredient is the map: \(\varphi: Q\times A\times Q \to L\), where \(A\) is a finite alphabet and \(Q\) a finite set of states such that \(\varphi(p, \sigma, q)\in L\) represent the proposition that input \(\sigma\in A\) causes the state \(p\) to become the state \(q\). In the paper under review the corresponding grammar to quantum automaton is established. Among others, it is shown that the set of \(L\)-valued quantum regular languages coincides with the set of \(L\)-valued quantum languages.