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

DOI10.1016/j.tcs.2012.02.018zbMath1254.68123OpenAlexW2094858455MaRDI QIDQ428877

Yun Shang, Xian Lu, Ru-qian Lu

Publication date: 25 June 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.018

zbMATH Keywords

quantum computationunsharp quantum logicMV-algebrapushdown automatafinite state automatalattice-ordered QMV algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) MV-algebras (06D35) Quantum logic (03G12)

Related Items (4)

Weak QMV algebras and some ring-like structures ⋮ Computing power of Turing machines in the framework of unsharp quantum logic ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Approximating families for lattice outer measures on unsharp quantum logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effect algebras and unsharp quantum logics.
• Automata theory based on quantum logic: Some characterizations
• Coexistence of qubit effects
• Quantum MV-algebras and commutativity
• Coexistence and joint measurability in quantum mechanics
• Lattices of quantum automata
• Quantum automata and quantum grammars
• Generalization of blocks for \(D\)-lattices and lattice-ordered effect algebras
• Automata theory based on quantum logic. I
• Characterizations of quantum automata
• Reasoning in quantum theory. Sharp and unsharp quantum logics.
• Quantum MV algebras
• Automata theory based on quantum logic: reversibilities and pushdown automata
• A theory of computation based on quantum logic. I
• Any orthocomplemented complete modular lattice is a continuous geometry
• Algebraic Analysis of Many Valued Logics
• Automata theory based on unsharp quantum logic
• Finite automata based on quantum logic and monadic second-order quantum logic
• Quantum computers.
• Automata theory based on quantum logic. II.

This page was built for publication: A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata