Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Computational Complementarity for Probabilistic Automata

Cristian S. Calude, Elena Calude, Karl Svozil

Published Jan 1, 2001• 2 citations
Publisher
DOI
10.1007/978-94-015-9634-3_9

Related papers

Analogues of quantum complementarity in the theory of automata

Karl Svozil

Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics•Mar 1, 1998•5 citations

Probabilistic Reversible Automata and Quantum Automata

Marats Golovkins, Maksim Kravtsev

Lecture notes in computer science•Jan 1, 2002•26 citations

Unary probabilistic and quantum automata on promise problems

Aida Gainutdinova, Abuzer Yakaryılmaz

arXiv:1502.01462•Quantum Information Processing•Dec 26, 2017•25 citations

Unary Probabilistic and Quantum Automata on Promise Problems

Aida Gainutdinova, Abuzer Yakaryılmaz

Lecture notes in computer science•Jan 1, 2015•15 citations

The Complexity of Probabilistic versus Quantum Finite Automata

Gatis Midrijānis

arXiv:quant-ph/0309080•Lecture notes in computer science•Jan 1, 2002•0 citations

On the complexity of minimizing probabilistic and quantum automata

Paulo Mateus, Daowen Qiu, Lvzhou Li

Information and Computation•Jul 20, 2012•32 citations