1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.FL2013
Finite automata with advice tapes
Uğur Küçük, A. C. Cem Say, Abuzer Yakaryılmaz
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is determini…
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…