The following pages link to (Q4452048):
Displaying 37 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)
- Size lower bounds for quantum automata (Q403023) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← 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)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← 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)
- On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← 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)
- Quantum automata for some multiperiodic languages (Q2465050) (← links)
- Small size quantum automata recognizing some regular languages (Q2484448) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- Algebraic Methods in Quantum Informatics (Q3522861) (← links)
- Lower Bounds for Generalized Quantum Finite Automata (Q3540128) (← links)
- Improved Constructions of Quantum Automata (Q5503296) (← links)
- Preface (Q5898759) (← links)
- Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)
