Hamming, Permutations and Automata

DOI10.1007/978-3-540-74871-7_3MaRDI QIDQ3608496zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds

Publication date 5 March 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74871-7_3

Mathematics Subject Classification ID

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

Recommendations

• Improved constructions of mixed state quantum automata
• Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
• Improved constructions of quantum automata
• Improved Constructions of Quantum Automata
• Dense quantum coding and quantum finite automata

Cited in

(4)

• Improved constructions of mixed state quantum automata
• Dense quantum coding and quantum finite automata
• Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
• Permutation automata

This page was built for publication: Hamming, Permutations and Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608496)