Finite automata based on quantum logic and monadic second-order quantum logic

DOI10.1007/S11432-010-0003-2zbMATH Open1497.81032DBLPjournals/chinaf/Li10OpenAlexW2013782635WikidataQ62038190 ScholiaQ62038190MaRDI QIDQ5046355FDOQ5046355

Authors:

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum logic (03G12) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

Cited In (6)

• Quantum reversible fuzzy grammars
• A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046355)