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

Lecture notes in computer science

Languages Recognized with Unbounded Error by Quantum Finite Automata

Abuzer Yakaryılmaz, A. C. Cem Say

Published Jan 1, 2009• 30 citations
Publisher
DOI
10.1007/978-3-642-03351-3_33

Related papers

Languages recognized with unbounded error by quantum finite automata

Abuzer Yakaryılmaz, A. C. Cem Say

This paper has been superseded by arXiv:1007.3624

arXiv:0809.0073•Aug 30, 2008•4 citations

Languages Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

Lecture notes in computer science•Jan 1, 2006•5 citations

Probabilities to Accept Languages by Quantum Finite Automata

Andris Ambainis, Richard Bonner, Rūsiņš Freivalds +1 more

arXiv:quant-ph/9904066•Lecture notes in computer science•Jan 1, 1999•41 citations

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem

Alberto Bertoni, Christian Choffrut, Flavio D’Alessandro

arXiv:1303.2967•Lecture notes in computer science•Jan 1, 2013•3 citations

Quantum Automata and Languages of Finite Index

Andrea Benso, Flavio D’Alessandro, Paolo Papi

Lecture notes in computer science•Jan 1, 2024•1 citation

Small size quantum automata recognizing some regular languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Theoretical Computer Science•Apr 19, 2005•30 citations