STACS 2004

DOI10.1007/B96012MaRDI QIDQ5309690zbMATH OpenOpenAlexFDO

Authors Martin Beaudry, Marats Golovkins, Arnolds Ķikusts, Mark Mercer, Denis Thérien, Andris Ambainis

Publication date 1 October 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96012

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Quantum computation (81P68)

Recommendations

• Algebraic results on quantum automata
• Implementation and Application of Automata
• Languages recognized by nondeterministic quantum finite automata
• scientific article; zbMATH DE number 1688355
• On finite automata with quantum and classical states

Cited in

(10)

• An application of quantum finite automata to interactive proof systems
• On a class of languages recognizable by probabilistic reversible decide-and-halt automata
• Mathematical logic and quantum finite state automata
• An automaton-theoretic approach to the representation theory of quantum algebras
• On language varieties without Boolean operations
• Algebraic results on quantum automata
• Quantum automata and algebraic groups
• scientific article; zbMATH DE number 7104930 (Why is no real title available?)
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
• Algebraic Characterizations of Unitary Linear Quantum Cellular Automata

This page was built for publication: STACS 2004

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