94 citations · 376 across the 55 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.FL2013
Unary languages recognized by two-way one-counter automata
Marzio De Biasi, Abuzer Yakaryilmaz
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we…
cs.CC2013★ 5 cited
Log-space counter is useful for unary languages by help of a constant-size quantum register
Abuzer Yakaryilmaz
The minimum amount of resources to recognize a nonregular language is a fundamental research topic in theoretical computer science which has been examined for different kinds of re…
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…