7 citations · 8 across the 3 of their papers we have counts for
4 papers
New Results on Vector and Homing Vector Automata
Özlem Salehi, Abuzer Yakaryılmaz, A. C. Cem Say
We present several new results and connections between various extensions of finite automata through the study of vector automata and homing vector automata. We show that homing ve…
Checking generalized debates with small space and randomness
H. Gökalp Demirci, A. C. Cem Say
We introduce a model of probabilistic debate checking, where a silent resource-bounded verifier reads a dialogue about the membership of the string in the language under considerat…
Probabilistic verifiers for asymmetric debates
H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryılmaz
We examine the power of silent constant-space probabilistic verifiers that watch asymmetric debates (where one side is unable to see some of the messages of the other) between two…
Probabilistic and quantum finite automata with postselection
Abuzer Yakaryilmaz, A. C. Cem Say
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model o…