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

DOI10.1016/J.TCS.2012.02.018zbMATH Open1254.68123OpenAlexW2094858455MaRDI QIDQ428877FDOQ428877

Authors Yun Shang, Xian Lu, Ruqian 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

pushdown automataquantum computationMV-algebrafinite state automatalattice-ordered QMV algebraunsharp quantum logic

Mathematics Subject Classification ID

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

Recommendations

• Automata theory based on unsharp quantum logic
• A theory of computation based on quantum logic. I
• Automata theory based on quantum logic: Some characterizations
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Automata theory based on quantum logic. II.

Cites work

• scientific article; zbMATH DE number 1688754 (Why is no real title available?)
• scientific article; zbMATH DE number 3603853 (Why is no real title available?)
• scientific article; zbMATH DE number 566410 (Why is no real title available?)
• scientific article; zbMATH DE number 1930741 (Why is no real title available?)
• scientific article; zbMATH DE number 3804225 (Why is no real title available?)
• scientific article; zbMATH DE number 3807678 (Why is no real title available?)
• scientific article; zbMATH DE number 849896 (Why is no real title available?)
• scientific article; zbMATH DE number 1418480 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• scientific article; zbMATH DE number 3186734 (Why is no real title available?)
• A theory of computation based on quantum logic. I
• Algebraic Analysis of Many Valued Logics
• Any orthocomplemented complete modular lattice is a continuous geometry
• Automata theory based on quantum logic. I
• Automata theory based on quantum logic. II.
• Automata theory based on quantum logic: Some characterizations
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Automata theory based on unsharp quantum logic
• Characterizations of quantum automata
• Coexistence and joint measurability in quantum mechanics
• Coexistence of qubit effects
• Effect algebras and unsharp quantum logics.
• Finite automata based on quantum logic and monadic second-order quantum logic
• Generalization of blocks for \(D\)-lattices and lattice-ordered effect algebras
• Lattices of quantum automata
• Quantum MV algebras
• Quantum MV-algebras and commutativity
• Quantum automata and quantum grammars
• Quantum computers.
• Quantum logic and automata theory
• Reasoning in quantum theory. Sharp and unsharp quantum logics.

Cited in

(13)

• scientific article; zbMATH DE number 3937180 (Why is no real title available?)
• Computing power of Turing machines in the framework of unsharp quantum logic
• Automata theory based on unsharp quantum logic
• An unsharp logic from quantum computation
• Weak QMV algebras and some ring-like structures
• A theory of computation based on quantum logic. I
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Approximating families for lattice outer measures on unsharp quantum logics
• The relationships among several forms of weighted finite automata over strong bimonoids
• scientific article; zbMATH DE number 7339588 (Why is no real title available?)
• Automata theory based on quantum logic. II.
• Quantum logic and automata theory
• Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428877)