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

On the State Complexity of Semi-quantum Finite Automata

Shenggen Zheng, Jozef Gruska, Daowen Qiu

Published Jan 1, 2014• 10 citations
Publisher
DOI
10.1007/978-3-319-04921-2_49

Related papers

Lower bounds on the size of semi-quantum finite automata

Lvzhou Li, Daowen Qiu

arXiv:1502.02839•Theoretical Computer Science•Oct 24, 2015•5 citations

The State Complexity of Two-Way Quantum Finite Automata

Marcos Villagra, Tomoyuki Yamakami

電子情報通信学会技術研究報告. COMP, コンピュテーション•Oct 1, 2014•0 citations

State complexity of one-way quantum finite automata together with classical states

Ligang Xiao, Daowen Qiu

Journal of Computer and System Sciences•May 2, 2025•2 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

Quantum Implementation of Finite State Automata

Varun Puram, Krishnageetha Karuppasamy, K. M. George +1 more

Lecture notes in networks and systems•Jan 1, 2025•0 citations

Quantum Finite State Automata

Jarosław Adam Miszczak

Synthesis lectures on quantum computing•Jan 1, 2012•0 citations