Automata theory based on quantum logic: Some characterizations
From MaRDI portal
Publication:598192
DOI10.1016/J.IC.2003.11.003zbMATH Open1074.68020DBLPjournals/iandc/Qiu04OpenAlexW2035423077WikidataQ62049466 ScholiaQ62049466MaRDI QIDQ598192FDOQ598192
Authors: Daowen Qiu 
Publication date: 6 August 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2003.11.003
Recommendations
Cites Work
- Title not available (Why is that?)
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- A single quantum cannot be cloned
- Probabilistic automata
- Title not available (Why is that?)
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum Complexity Theory
- Upper bound on the success probability of separation among quantum states
- Title not available (Why is that?)
- Logical Reversibility of Computation
- Orthomodular structures as quantum logics. Transl. from the Slovak
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Title not available (Why is that?)
- Axiom schemes for m-valued propositions calculi
- Title not available (Why is that?)
- Analog computation via neural networks
- Title not available (Why is that?)
- Quantum automata and quantum grammars
- Characterizations of 1-Way Quantum Finite Automata
- Quantum computers.
- Automata theory based on quantum logic. II.
- Title not available (Why is that?)
- Regular languages accepted by quantum automata
- Title not available (Why is that?)
- Characterization of sequential quantum machines
- Non-optimal universal quantum deleting machine
- Some general probabilistic quantum cloning and deleting machines
- Quantum pushdown automata
- A topology for automata: A note
- The source as a tool in automata
Cited In (50)
- Automata theory based on quantum logic: recognizability and accessibility
- Characterization of tree automata based on quantum logic
- Logics from quantum computation with bounded additive operators
- Notes on automata theory based on quantum logic
- Title not available (Why is that?)
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- \(L\)-fuzzy automata theory: some characterizations via general fuzzy operators
- A new characterization of congruences and the discrete Sugeno integral on LB-valued general fuzzy automata
- On \(L\)-fuzzy automata, coalgebras and dialgebras: associated categories and \(L\)-fuzzy topologies
- An improved algorithm for determinization of weighted and fuzzy automata
- Spectral automorphisms in quantum logics
- Finite automata theory with membership values in lattices
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Categories of Automata and Languages Based on a Complete Residuated Lattice
- Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata
- Measure of Operators Associated with Fuzzy Automata
- Automata theory based on quantum logic. II.
- \(L^B\)-valued general fuzzy automata
- Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices
- Myhill-Nerode type theory for fuzzy languages and automata
- Determinization of weighted finite automata over strong bimonoids
- Lattices of quantum automata
- Weighted nested word automata and logics over strong bimonoids
- Algebraic results on quantum automata
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Characterizations of quantum automata
- Errata: Automorphisms and symmetries of quantum logics
- On \(L^M\)-valued automata: an operator oriented view
- On a category of fuzzy automata with relations
- Analogues of quantum complementarity in the theory of automata
- FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE
- Weak QMV algebras and some ring-like structures
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Topological characterizations of automata theory based on quantum logic
- 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
- LOGICS FROM QUANTUM COMPUTATION
- New directions in LB-valued general fuzzy automata: A topological view
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Consequences and conjectures in preordered sets
- Automata theory based on unsharp quantum logic
- On typical hesitant fuzzy languages and automata
- QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS
- Fuzzy grammar theory based on lattices
- On coverings of products of uninitialized sequential quantum machines
- On intuitionistic fuzzy context-free languages
- Automaton partition logic versus quantum logic
- Quantum \(\omega\)-automata over infinite words and their relationships
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
This page was built for publication: Automata theory based on quantum logic: Some characterizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598192)
