Behaviours of unary quantum automata

DOI10.3233/FI-2010-333MaRDI QIDQ3000288zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

quantum automataunary languagesperiodic events

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

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.

Cited in

(12)

• Size lower bounds for quantum automata
• Descriptional complexity of iterated uniform finite-state transducers
• Latvian quantum finite state automata for unary languages
• Quantum automata and periodic events
• Descriptional complexity of two-way pushdown automata with restricted head reversals
• Complexity of promise problems on classical and quantum automata
• The descriptional power of queue automata of constant length
• Some formal tools for analyzing quantum automata.
• Removing nondeterminism in constant height pushdown automata
• Boolean language operations on nondeterministic automata with a pushdown of constant height
• Quantum finite automata: advances on Bertoni's ideas
• Latvian quantum finite state automata for unary languages

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)