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 Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

Published Jan 1, 2006• 5 citations
Publisher
DOI
10.1007/11605157_1

Related papers

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

Andris Ambainis, Arnolds Ķikusts, Māris Valdats

Springer eBooks•Jun 12, 2007•46 citations

Quantum Automata and Languages of Finite Index

Andrea Benso, Flavio D’Alessandro, Paolo Papi

Lecture notes in computer science•Jan 1, 2024•2 citations

Languages Recognized with Unbounded Error by Quantum Finite Automata

Abuzer Yakaryılmaz, A. C. Cem Say

Lecture notes in computer science•Jan 1, 2009•30 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•35 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•4 citations

Quantum Finite Automata and Logics

Ilze Dzelme-Bērziņa

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