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

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.

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)

Cites Work

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

Cited In (12)

• Approximating families for lattice outer measures on unsharp quantum logics
• Title not available (Why is that?)
• Automata theory based on quantum logic. II.
• An unsharp logic from quantum computation
• Quantum logic and automata theory
• Weak QMV algebras and some ring-like structures
• Automata theory based on quantum logic: reversibilities and pushdown automata
• A theory of computation based on quantum logic. I
• The relationships among several forms of weighted finite automata over strong bimonoids
• Computing power of Turing machines in the framework of unsharp quantum logic
• Title not available (Why is that?)
• Automata theory based on unsharp quantum logic

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)