activity
20112019
most citedProbabilistic and quantum finite automata with postselection

7 citations · 10 across the 4 of their papers we have counts for

collaborators

7 papers

cs.FL2019

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…

cs.FL2018

Language Classes Associated With Automata Over Matrix Groups

Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say

We investigate the language classes recognized by group automata over matrix groups. For the case of matrices, we prove that the corresponding group automata for rati…

cs.FL2018★ 2 cited

Extended finite automata and decision problems for matrix semigroups

Özlem Salehi, Ahmet Celal Cem Say

We make a connection between the subgroup membership and identity problems for matrix groups and extended finite automata. We provide an alternative proof for the decidability of t…

cs.FL2016

Language Classes Associated with Automata Over Matrix Groups

Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say

We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We l…

cs.CC2012

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…

cs.CC2012★ 1 cited

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…