Pages that link to "Item:Q1586380"
From MaRDI portal
The following pages link to Automata theory based on quantum logic. I (Q1586380):
Displayed 19 items.
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata (Q428877) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- Myhill-Nerode type theory for fuzzy languages and automata (Q969583) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
- Weak QMV algebras and some ring-like structures (Q1701734) (← links)
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata'' (Q1759734) (← links)
- Characterization of tree automata based on quantum logic (Q2113952) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- On intuitionistic fuzzy context-free languages (Q2375678) (← links)
- Automata theory based on quantum logic: recognizability and accessibility (Q2390829) (← links)
- Finite state and finite stop quantum languages (Q2506022) (← links)
- A theory of computation based on quantum logic. I (Q2575078) (← links)
- LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS (Q2909551) (← links)
- WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS (Q2929640) (← links)
- QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS (Q3502995) (← links)
- LOGICS FROM QUANTUM COMPUTATION (Q5696621) (← links)