4 citations · 8 across the 3 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2000★ 4 cited
On the class of languages recognizable by 1-way quantum finite automata
Andris Ambainis, Arnolds Kikusts, Maris Valdats
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) l…
quant-ph2000★ 3 cited
The class of languages recognizable by 1-way quantum finite automata is not closed under union
Maris Valdats
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite auto…