94 citations · 376 across the 55 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.CC2009
Languages recognized by nondeterministic quantum finite automata
Abuzer Yakaryilmaz, A. C. Cem Say
The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of…
cs.CC2009
Language recognition by generalized quantum finite automata with unbounded error (abstract & poster)
Abuzer Yakaryilmaz, A. C. Cem Say
In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's ar…