Behaviours of unary quantum automata
From MaRDI portal
Publication:3000288
DOI10.3233/FI-2010-333zbMATH Open1214.68191OpenAlexW1742089180MaRDI QIDQ3000288FDOQ3000288
Authors: Maria Paola Bianchi, Beatrice Palano 
Publication date: 18 May 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2010-333
Recommendations
- Quantum automata and periodic events
- Small size quantum automata recognizing some regular languages
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Lower bounds on the size of quantum automata accepting unary languages.
- Unary probabilistic and quantum automata on promise problems
Cited In (10)
- Size lower bounds for quantum automata
- Descriptional complexity of iterated uniform finite-state transducers
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Unary probabilistic and quantum automata on promise problems
- The descriptional power of queue automata of constant length
- Some formal tools for analyzing quantum automata.
- Removing nondeterminism in constant height pushdown automata
- Complexity of Promise Problems on Classical and Quantum Automata
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- Quantum finite automata: advances on Bertoni's ideas
This page was built for publication: Behaviours of unary quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000288)
