A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata (Q428877)

The main aim of the paper is to develop a systematic theory of quantum computation based not only on sharp quantum logic but also on unsharp quantum logic. The paper studies two algebraic models of quantum logic: (i) lattice-ordered QMV algebras, and (ii) extended lattice-ordered effect algebras. The latter one is an effect algebra where the partial operation \(+\) is extended to a total one \(\boxplus\) assuming that \(a\boxplus b :=1\) whenever \(a+b\) is not defined in \(E\), otherwise \(a\boxplus b :=a+b.\) For such structures, \(\mathcal E\)-valued finite state automata and \(\mathcal E\)-valued pushdown automata are introduced and studied and compared with previous automata. Classes of languages accepted by these automata are exhibited.