Pages that link to "Item:Q1884961"
From MaRDI portal
The following pages link to Characterizations of quantum automata (Q1884961):
Displaying 23 items.
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata (Q428877) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Analogues of quantum complementarity in the theory of automata (Q639815) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- Pumping lemma for quantum automata (Q1768681) (← links)
- Regular languages accepted by quantum automata (Q1854417) (← links)
- Quantum pushdown automata (Q1863756) (← links)
- Characterization of tree automata based on quantum logic (Q2113952) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- Relativizations of nonuniform quantum finite automata families (Q2326825) (← links)
- Automata theory based on quantum logic: recognizability and accessibility (Q2390829) (← links)
- Algebraic results on quantum automata (Q2432533) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Finite state and finite stop quantum languages (Q2506022) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- STACS 2005 (Q5710692) (← links)
- Quaternionic quantum automata (Q6114652) (← links)
- Mirrors and memory in quantum automata (Q6160780) (← links)
