| Unbounded-error quantum computation with small space bounds A Yakaryılmaz, ACC Say Information and Computation 209 (6), 873-892, 2011 | 96 | 2011 |
| Succinctness of two-way probabilistic and quantum finite automata A Yakaryılmaz, ACC Say arXiv preprint arXiv:0903.0050, 2009 | 73* | 2009 |
| Qualitative system identification: deriving structure from behavior ACC Say, S Kuru Artificial Intelligence 83 (1), 75-141, 1996 | 71 | 1996 |
| Languages recognized by nondeterministic quantum finite automata A Yakaryılmaz, ACC Say arXiv preprint arXiv:0902.2081, 2009 | 58 | 2009 |
| Quantum finite automata: A modern introduction ACC Say, A Yakaryılmaz arXiv preprint arXiv:1406.4048, 2014 | 53 | 2014 |
| Sound and complete qualitative simulation is impossible ACC Say, HL Akın Artificial Intelligence 149 (2), 251-266, 2003 | 33 | 2003 |
| Languages recognized with unbounded error by quantum finite automata A Yakaryılmaz, ACC Say Computer Science-Theory and Applications, 356-367, 2009 | 32 | 2009 |
| Quantum computation with write-only memory A Yakaryılmaz, R Freivalds, ACC Say, R Agadzanyan Natural Computing 11 (1), 81-94, 2012 | 31* | 2012 |
| Magic coins are useful for small-space quantum machines AC Say, A Yakaryilmaz arXiv preprint arXiv:1411.7647, 2014 | 21 | 2014 |
| Efficient probability amplification in two-way quantum finite automata A Yakaryılmaz, ACC Say Theoretical Computer Science 410 (20), 1932-1941, 2009 | 21 | 2009 |
| Improved filtering for the QSIM algorithm ACC Say, S Kuru IEEE transactions on pattern analysis and machine intelligence 15 (9), 967-971, 1993 | 21 | 1993 |
| A linguistically motivated information retrieval system for Turkish FC Pembe, ACC Say International Symposium on Computer and Information Sciences, 741-750, 2004 | 20 | 2004 |
| A new family of nonstochastic languages R Freivalds, A Yakaryılmaz, ACC Say Information Processing Letters 110 (10), 410-413, 2010 | 19 | 2010 |
| L'Hôpital's Filter for QSIM ACC Say Pattern Analysis and Machine Intelligence, IEEE Transactions on 20 (1), 1-8, 1998 | 17 | 1998 |
| Proving the power of postselection A Yakaryilmaz, AC Say arXiv preprint arXiv:1111.3125, 2011 | 15 | 2011 |
| Quantum counter automata ACC Say, A Yakaryılmaz International Journal of Foundations of Computer Science 23 (05), 1099-1116, 2012 | 11* | 2012 |
| Probabilistic and quantum finite automata with postselection A Yakaryılmaz, ACC Say arXiv preprint arXiv:1102.0666, 2011 | 11 | 2011 |
| Finite automata with advice tapes U Küçük, ACC Say, A Yakaryilmaz International Journal of Foundations of Computer Science 25 (08), 987-1000, 2014 | 10 | 2014 |
| Classical and quantum realtime alternating automata HG Demirci, M Hirvensalo, K Reinhardt, ACC Say, A Yakaryılmaz arXiv preprint arXiv:1407.0334, 2014 | 9 | 2014 |
| Tight bounds for the space complexity of nonregular language recognition by real-time machines A Yakaryılmaz, ACC Say International Journal of Foundations of Computer Science 24 (08), 1243-1253, 2013 | 9 | 2013 |
Abuzer YakaryilmazUniversity of LatviaVerified email at lu.lv
