activity
20082026
most citedUnbounded-error quantum computation with small space bounds

94 citations · 176 across the 26 of their papers we have counts for

collaborators
Showing cs.FLShow all

7 papers · 1 filter

cs.FL2016

Homing Vector Automata

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

We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to r…

cs.FL2015★ 1 cited

Inkdots as advice for finite automata

Uğur Küçük, A. C. Cem Say, Abuzer Yakaryılmaz

We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of a…

cs.FL2015

Homing Vector Automata

Özlem Salehi, A. C. Cem Say

We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to r…

cs.FL2014

Alternating, private alternating, and quantum alternating realtime automata

Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt +2

We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-count…

cs.FL2014★ 5 cited

Quantum finite automata: A modern introduction

A. C. Cem Say, Abuzer Yakaryilmaz

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum comp…

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.FL2013★ 4 cited

Real-Time Vector Automata

Özlem Salehi, Abuzer Yakaryılmaz, A. C. Cem Say

We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appro…