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

Regular Languages Accepted by Quantum Automata

Alberto Bertoni, Marco Carpentieri

Published Mar 1, 2001• 54 citations
Publisher
DOI
10.1006/inco.2000.2911

Related papers

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

Small size quantum automata recognizing some regular languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Theoretical Computer Science•Apr 19, 2005•30 citations

Languages Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

Lecture notes in computer science•Jan 1, 2006•5 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

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Lecture notes in computer science•Jan 1, 2003•9 citations

Events and Languages on Unary Quantum Automata

Maria Paola Bianchi, Beatrice Palano

Non-Classical Models for Automata and Applications•Jan 1, 2009•3 citations