Automata theory based on quantum logic. II.
From MaRDI portal
Publication:5941828
DOI10.1023/A:1026453524064zbMath1047.81007OpenAlexW1594567376MaRDI QIDQ5941828
Publication date: 4 September 2001
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026453524064
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (25)
Notes on automata theory based on quantum logic ⋮ On intuitionistic fuzzy context-free languages ⋮ Interval type-2 fuzzy automata and interval type-2 fuzzy grammar ⋮ LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS ⋮ Automata theory based on quantum logic: recognizability and accessibility ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ Automata theory based on quantum logic: Some characterizations ⋮ QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS ⋮ Towards implementation of a generalized architecture for high-level quantum programming language ⋮ 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 ⋮ 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 ⋮ Quantum Reversible Fuzzy Grammars ⋮ 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 ⋮ Finite state and finite stop quantum languages ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Automata theory based on unsharp quantum logic ⋮ On coverings of products of uninitialized sequential quantum machines ⋮ Characterization of tree automata based on quantum logic
This page was built for publication: Automata theory based on quantum logic. II.