Say, A. C. Cem

1. Magic coins are useful for small-space quantum machines
   2014/11/27 by Say, A. C. Cem, Yakaryilmaz, Abuzer · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Formal Languages and Automata Theory (cs.FL) #Quantum Physics (quant-ph)
2. Languages recognized with unbounded error by quantum finite automata
   2008/08/30 by Yakaryilmaz, Abuzer, Say, A. C. Cem · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
3. Quantum finite automata: A modern introduction
   2014/06/16 by A. C. Cem Say, Say, A. C. Cem, Abuzer Yakaryılmaz +1 · 1 citation
   Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Formal Languages and Automata Theory (cs.FL) #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #semigroups and automata theory
4. Probabilistic and quantum finite automata with postselection
   2011/02/03 by Abuzer Yakaryılmaz, A. C. Cem Say, Yakaryilmaz, Abuzer +1 · 1 citation
   Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Machine Learning and Algorithms #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #semigroups and automata theory