Automata theory based on unsharp quantum logic
From MaRDI portal
Recommendations
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- Automata theory based on quantum logic: recognizability and accessibility
- Automata theory based on quantum logic: Some characterizations
- Automata theory based on quantum logic. II.
- A theory of computation based on quantum logic. I
Cites work
- 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. II.
- Effect algebras and unsharp quantum logics.
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3804225 (Why is no real title available?)
- scientific article; zbMATH DE number 3186734 (Why is no real title available?)
- Quantum MV algebras
- Reasoning in quantum theory. Sharp and unsharp quantum logics.
- The logic of quantum mechanics
Cited in
(8)- Weak QMV algebras and some ring-like structures
- An unsharp logic from quantum computation
- Automaton partition logic versus quantum logic
- Automata theory based on quantum logic: recognizability and accessibility
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- Computing power of Turing machines in the framework of unsharp quantum logic
- scientific article; zbMATH DE number 7339588 (Why is no real title available?)
- The computing power of Turing machine based on quantum logic
This page was built for publication: Automata theory based on unsharp quantum logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395311)
