Följ
Cem Say
Cem Say
Boğaziçi Üniversitesi
Verifierad e-postadress på boun.edu.tr - Startsida
Titel
Citeras av
Citeras av
År
Unbounded-error quantum computation with small space bounds
A Yakaryılmaz, ACC Say
Information and Computation 209 (6), 873-892, 2011
982011
Succinctness of two-way probabilistic and quantum finite automata
A Yakaryılmaz, ACC Say
arXiv preprint arXiv:0903.0050, 2009
75*2009
Qualitative system identification: deriving structure from behavior
ACC Say, S Kuru
Artificial Intelligence 83 (1), 75-141, 1996
721996
Quantum finite automata: A modern introduction
ACC Say, A Yakaryılmaz
arXiv preprint arXiv:1406.4048, 2014
632014
Languages recognized by nondeterministic quantum finite automata
A Yakaryılmaz, ACC Say
arXiv preprint arXiv:0902.2081, 2009
592009
Languages recognized with unbounded error by quantum finite automata
A Yakaryılmaz, ACC Say
Computer Science-Theory and Applications, 356-367, 2009
332009
Sound and complete qualitative simulation is impossible
ACC Say, HL Akın
Artificial Intelligence 149 (2), 251-266, 2003
332003
Quantum computation with write-only memory
A Yakaryılmaz, R Freivalds, AC Say, R Agadzanyan
Natural Computing 11 (1), 81-94, 2012
32*2012
Efficient probability amplification in two-way quantum finite automata
A Yakaryılmaz, ACC Say
Theoretical Computer Science 410 (20), 1932-1941, 2009
222009
A linguistically motivated information retrieval system for Turkish
FC Pembe, ACC Say
International Symposium on Computer and Information Sciences, 741-750, 2004
222004
Magic coins are useful for small-space quantum machines
AC Say, A Yakaryilmaz
arXiv preprint arXiv:1411.7647, 2014
212014
Improved filtering for the QSIM algorithm
ACC Say, S Kuru
IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (9), 967-971, 1993
211993
A new family of nonstochastic languages
R Freivalds, A Yakaryılmaz, ACC Say
Information Processing Letters 110 (10), 410-413, 2010
192010
L'Hôpital's Filter for QSIM
ACC Say
Pattern Analysis and Machine Intelligence, IEEE Transactions on 20 (1), 1-8, 1998
171998
Proving the power of postselection
A Yakaryılmaz, AC Say
Fundamenta Informaticae 123 (1), 107-134, 2013
162013
Quantum counter automata
ACC Say, A Yakaryılmaz
International Journal of Foundations of Computer Science 23 (05), 1099-1116, 2012
12*2012
Finite automata with advice tapes
U Küçük, ACC Say, A Yakaryilmaz
International Journal of Foundations of Computer Science 25 (08), 987-1000, 2014
112014
Probabilistic and quantum finite automata with postselection
A Yakaryılmaz, ACC Say
arXiv preprint arXiv:1102.0666, 2011
112011
The weakness of CTC qubits and the power of approximate counting
R O'Donnell, ACC Say
ACM Transactions on Computation Theory (TOCT) 10 (2), 1-22, 2018
102018
Classical and quantum realtime alternating automata
HG Demirci, M Hirvensalo, K Reinhardt, ACC Say, A Yakaryılmaz
arXiv preprint arXiv:1407.0334, 2014
92014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20