Finite automata based on quantum logic and monadic second-order quantum logic
From MaRDI portal
Publication:5046355
DOI10.1007/s11432-010-0003-2zbMath1497.81032DBLPjournals/chinaf/Li10OpenAlexW2013782635WikidataQ62038190 ScholiaQ62038190MaRDI QIDQ5046355
No author found.
Publication date: 28 October 2022
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-010-0003-2
Quantum computation (81P68) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum logic (03G12)
Related Items (6)
A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata ⋮ Quantum Reversible Fuzzy Grammars ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices
This page was built for publication: Finite automata based on quantum logic and monadic second-order quantum logic
