Pages that link to "Item:Q764358"
From MaRDI portal
The following pages link to Characterizations of one-way general quantum finite automata (Q764358):
Displaying 24 items.
- Lower bounds on the size of semi-quantum finite automata (Q264532) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Energy complexity of regular language recognition (Q2164753) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- (Q5232904) (← links)
- On the Computational Power of Affine Automata (Q5739014) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- On the Power of One-Way Automata with Quantum and Classical States (Q5744127) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Energy complexity of regular languages (Q6199407) (← links)
