Finite automata based on quantum logic and monadic second-order quantum logic
From MaRDI portal
Publication:5046355
Cited in
(6)- 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
- Quantum reversible fuzzy grammars
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- The relationships among several forms of weighted finite automata over strong bimonoids
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)