94 citations · 376 across the 55 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
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★ 16 cited
Automata and Quantum Computing
Andris Ambainis, Abuzer Yakaryılmaz
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring.…
cs.CC2015★ 3 cited
Unary probabilistic and quantum automata on promise problems
Aida Gainutdinova, Abuzer Yakaryilmaz
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error…