Pages that link to "Item:Q428877"

The following pages link to A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata (Q428877):

Displaying 9 items.

• Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
• Weak QMV algebras and some ring-like structures (Q1701734) (← links)
• An unsharp logic from quantum computation (Q1768735) (← links)
• Approximating families for lattice outer measures on unsharp quantum logics (Q2105722) (← links)
• The relationships among several forms of weighted finite automata over strong bimonoids (Q2293180) (← links)
• Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
• A theory of computation based on quantum logic. I (Q2575078) (← links)
• Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness (Q2658032) (← links)
• (Q4986195) (← links)