Automata theory based on quantum logic: Some characterizations
From MaRDI portal
Publication:598192
DOI10.1016/j.ic.2003.11.003zbMath1074.68020OpenAlexW2035423077WikidataQ62049466 ScholiaQ62049466MaRDI QIDQ598192
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
Related Items
Notes on automata theory based on quantum logic ⋮ On intuitionistic fuzzy context-free languages ⋮ LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS ⋮ Automata theory based on quantum logic: recognizability and accessibility ⋮ WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ New directions in LB-valued general fuzzy automata: A topological view ⋮ Fuzzy grammar theory based on lattices ⋮ \(L^B\)-valued general fuzzy automata ⋮ QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS ⋮ Finite automata theory with membership values in lattices ⋮ A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata ⋮ Weak QMV algebras and some ring-like structures ⋮ On a category of fuzzy automata with relations ⋮ LOGICS FROM QUANTUM COMPUTATION ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ Computing power of Turing machines in the framework of unsharp quantum logic ⋮ FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Consequences and conjectures in preordered sets ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ On \(L^M\)-valued automata: an operator oriented view ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ On coverings of products of uninitialized sequential quantum machines ⋮ Characterization of tree automata based on quantum logic ⋮ Categories of Automata and Languages Based on a Complete Residuated Lattice ⋮ Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices ⋮ Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata ⋮ Measure of Operators Associated with Fuzzy Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Orthomodular structures as quantum logics. Transl. from the Slovak
- Analog computation via neural networks
- Quantum automata and quantum grammars
- Characterization of sequential quantum machines
- Non-optimal universal quantum deleting machine
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Regular languages accepted by quantum automata
- Some general probabilistic quantum cloning and deleting machines
- Quantum pushdown automata
- Characterizations of 1-Way Quantum Finite Automata
- A topology for automata: A note
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Upper bound on the success probability of separation among quantum states
- A single quantum cannot be cloned
- Probabilistic automata
- The source as a tool in automata
- Logical Reversibility of Computation
- Axiom schemes for m-valued propositions calculi
- Quantum computers.
- Automata theory based on quantum logic. II.
This page was built for publication: Automata theory based on quantum logic: Some characterizations
