Automata theory based on quantum logic: reversibilities and pushdown automata

DOI10.1016/j.tcs.2007.05.026zbMath1137.68036OpenAlexW2010050150WikidataQ62049457 ScholiaQ62049457MaRDI QIDQ2455592

Dao Wen Qiu

Publication date: 25 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.026

zbMATH Keywords

orthomodular latticesquantum computationquantum logicfinite automatapushdown automataQuantum finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum logic (03G12)

Related Items

Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets, Approximation of fuzzy context-free grammars, 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, Quaternionic quantum automata, Learning quantum finite automata with queries, 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, Weak Second‐Order Arithmetic and Finite 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, Hierarchy and equivalence of multi-letter quantum finite automata, Determinization of weighted finite automata over strong bimonoids, Consequences and conjectures in preordered sets, Weighted automata and multi-valued logics over arbitrary bounded lattices, Automata theory based on complete residuated lattice-valued logic: Pushdown automata, On coverings of products of uninitialized sequential quantum machines, Characterization of tree automata based on quantum logic, Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata theory based on quantum logic: Some characterizations
• Orthomodular structures as quantum logics. Transl. from the Slovak
• Grammar theory based on quantum logic
• Quantum automata and quantum grammars
• Characterization of sequential quantum machines
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• An unsharp logic from quantum computation
• Two-way finite automata with quantum and classical states.
• Characterizations of quantum automata
• Dense quantum coding and a lower bound for 1-way quantum automata
• Characterizations of 1-Way Quantum Finite Automata
• Inference of Reversible Languages
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• DYNAMIC QUANTUM LOGIC FOR QUANTUM PROGRAMS
• Implementation and Application of Automata
• Probabilistic automata
• Probabilistic and weighted grammars
• Connectivity and Reversibility in Automata
• Probabilistic grammars and automata
• Logical Reversibility of Computation
• Quantum computers.
• Automata theory based on quantum logic. II.
• Analogies and differences between quantum and stochastic automata