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

Information and Computation

On the complexity of minimizing probabilistic and quantum automata

Paulo Mateus, Daowen Qiu, Lvzhou Li

Published Jul 20, 2012• 32 citations
Publisher
DOI
10.1016/j.ic.2012.07.002

Related papers

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

Probabilistic Reversible Automata and Quantum Automata

Marats Golovkins, Maksim Kravtsev

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

Unary probabilistic and quantum automata on promise problems

Aida Gainutdinova, Abuzer Yakaryılmaz

Quantum Information Processing•Dec 26, 2017•22 citations

Unary Probabilistic and Quantum Automata on Promise Problems

Aida Gainutdinova, Abuzer Yakaryılmaz

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

A minimization algorithm of 1-way quantum finite automata

Olga Siedlecka-Lamch

Metody Informatyki Stosowanej•Jan 1, 2010•0 citations

Quantum versus Probabilistic One-Way Finite Automata with Counter

Richard Bonner, Rūsiņš Freivalds, Maksim Kravtsev

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