Recommendations
Cites work
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 2040892 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1759400 (Why is no real title available?)
- scientific article; zbMATH DE number 2090013 (Why is no real title available?)
- Algebraic results on quantum automata
- Angles in complex vector spaces
- Behaviours of unary quantum automata
- Characterizations of 1-Way Quantum Finite Automata
- Lower Bounds for Generalized Quantum Finite Automata
- On Varieties of Literally Idempotent Languages
- On the state complexity of semi-quantum finite automata
- One-way finite automata with quantum and classical states
- Probabilistic automata
- Quantum automata and quantum grammars
- Quantum automata for some multiperiodic languages
- Quantum finite automata with control language
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- Superiority of exact quantum automata for promise problems
- Trace monoids with idempotent generators and measure-only quantum automata
Cited in
(8)- On the power of one-way automata with quantum and classical states
- Lower bounds on the size of semi-quantum finite automata
- Lower Bounds for Generalized Quantum Finite Automata
- Quantum bounds for 2D-grid and Dyck language
- Size lower bounds for quantum automata
- scientific article; zbMATH DE number 2044497 (Why is no real title available?)
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Quantum finite automata: advances on Bertoni's ideas
This page was built for publication: Size lower bounds for quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403023)
