94 citations · 176 across the 26 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.CC2009★ 1 cited
Succinctness of two-way probabilistic and quantum finite automata
Abuzer Yakaryilmaz, A. C. Cem Say
We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-w…
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…