Pages that link to "Item:Q1604939"
From MaRDI portal
The following pages link to Characterization of sequential quantum machines (Q1604939):
Displayed 20 items.
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Characterizations of quantum automata (Q1884961) (← links)
- Characterization of tree automata based on quantum logic (Q2113952) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Automata theory based on quantum logic: recognizability and accessibility (Q2390829) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Quaternionic quantum automata (Q6114652) (← links)