activity
20082025
most citedExponentially more concise quantum recognition of non-RMM regular languages

5 citations · 10 across the 3 of their papers we have counts for

collaborators
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2008★ 5 cited

Decidability of the Equivalence of Multi-Letter Quantum Finite Automata

Daowen Qiu, Xiangfu Zou, Lvzhou Li +1

Multi-letter {\it quantum finite automata} (QFAs) were a quantum variant of classical {\it one-way multi-head finite automata} (J. Hromkovič, Acta Informatica 19 (1983) 377-384), a…