Lower bounds on the size of quantum automata accepting unary languages.
From MaRDI portal
(Redirected from Publication:5897352)
Recommendations
Cited in
(17)- Some algebraic properties of measure-once two-way quantum finite automata
- Quantum automata for some multiperiodic languages
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- Behaviours of unary quantum automata
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- scientific article; zbMATH DE number 6533717 (Why is no real title available?)
- Lower Bounds for Generalized Quantum Finite Automata
- Size lower bounds for quantum automata
- scientific article; zbMATH DE number 2044497 (Why is no real title available?)
- scientific article; zbMATH DE number 1759400 (Why is no real title available?)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- Quantum finite automata: advances on Bertoni's ideas
- Size lower bounds for quantum automata
- Developments in Language Theory
- Preface
- Quantum bounds for 2D-grid and Dyck language
This page was built for publication: Lower bounds on the size of quantum automata accepting unary languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897352)
