A. C. Cem Say

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 32

Top Topics

Regular Languages

Space Complexity

Finite Automata

Top Venues

Electron. Colloquium Comput. Complex.

Int. J. Found. Comput. Sci.

Publications

Firat Kiyak, A. C. Cem Say
Energy complexity of regular languages. Theor. Comput. Sci. 982 (2024)
M. Utkan Gezer, A. C. Cem Say
Finite state verifiers with both private and public coins. CoRR (2023)
Firat Kiyak, A. C. Cem Say
Read-once machines and the thermodynamic complexity of Maxwell's demons. CoRR (2023)
M. Utkan Gezer, Özdeniz Dolu, Nevzat Ersoy, A. C. Cem Say
Real-time, constant-space, constant-randomness verifiers. Theor. Comput. Sci. 976 (2023)
M. Utkan Gezer, A. C. Cem Say
Finite State Verifiers with Both Private and Public Coins. ICTCS (2023)
Ahmet Bilal Uçan, A. C. Cem Say
Advice hierarchies among finite automata. Inf. Comput. 288 (2022)
Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say
Energy Complexity of Regular Language Recognition. CoRR (2022)
M. Utkan Gezer, A. C. Cem Say
Constant-space, constant-randomness verifiers with arbitrarily small error. Inf. Comput. 288 (2022)
Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say
Energy Complexity of Regular Language Recognition. CIAA (2022)
Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say
Real-Time, Constant-Space, Constant-Randomness Verifiers. CoRR (2022)
Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say
Real-Time, Constant-Space, Constant-Randomness Verifiers. CIAA (2022)
M. Utkan Gezer, A. C. Cem Say
Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error. CoRR (2020)
Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
New Results on Vector and Homing Vector Automata. CoRR (2019)
Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
New Results on Vector and Homing Vector Automata. Int. J. Found. Comput. Sci. 30 (8) (2019)
Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. 15 (3) (2019)
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
Language Classes Associated With Automata Over Matrix Groups. CoRR (2018)
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
Language classes associated with automata over matrix groups. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Ryan O'Donnell, A. C. Cem Say
The Weakness of CTC Qubits and the Power of Approximate Counting. ACM Trans. Comput. Theory 10 (2) (2018)
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
Generalized Results on Monoids as Memory. AFL (2017)
A. C. Cem Say, Abuzer Yakaryilmaz
Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. 17 (11&12) (2017)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Inkdots as advice for finite automata. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
Language Classes Associated with Automata Over Matrix Groups. CoRR (2016)
Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro
Homing vector automata. CoRR (2016)
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
Language classes associated with automata over matrix groups. NCMA (2016)
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
Debates with Small Transparent Quantum Verifiers. Int. J. Found. Comput. Sci. 27 (2) (2016)
Ryan O'Donnell, A. C. Cem Say
The weakness of CTC qubits and the power of approximate counting. Electron. Colloquium Comput. Complex. 23 (2016)
Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro
Homing vector automata. RAIRO Theor. Informatics Appl. 50 (4) (2016)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Inkdots as advice to small-space machines. CoRR (2015)
Cafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say
Optimal Bounds for Estimating Entropy with PMF Queries. MFCS (2) (2015)
H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
The Complexity of Debate Checking. Theory Comput. Syst. 57 (1) (2015)
Özlem Salehi, A. C. Cem Say
Homing Vector Automata. CoRR (2015)
Özlem Salehi, A. C. Cem Say
Homing vector automata. NCMA (2015)
Ryan O'Donnell, A. C. Cem Say
One time-travelling bit is as good as logarithmically many. Electron. Colloquium Comput. Complex. 21 (2014)
H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
Classical and quantum realtime alternating automata. NCMA (2014)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Finite Automata with Advice Tapes. Int. J. Found. Comput. Sci. 25 (8) (2014)
H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
Classical and quantum realtime alternating automata. CoRR (2014)
A. C. Cem Say, Abuzer Yakaryilmaz
Finite state verifiers with constant randomness Log. Methods Comput. Sci. 10 (3) (2014)
H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
The Complexity of Debate Checking. Electron. Colloquium Comput. Complex. 21 (2014)
A. C. Cem Say, Abuzer Yakaryilmaz
Quantum Finite Automata: A Modern Introduction. Computing with New Resources (2014)
Ryan O'Donnell, A. C. Cem Say
One Time-traveling Bit is as Good as Logarithmically Many. FSTTCS (2014)
A. C. Cem Say, Abuzer Yakaryilmaz
Quantum finite automata: A modern introduction. CoRR (2014)
A. C. Cem Say, Abuzer Yakaryilmaz
Magic coins are useful for small-space quantum machines. CoRR (2014)
A. C. Cem Say, Abuzer Yakaryilmaz
Magic coins are useful for small-space quantum machines. Electron. Colloquium Comput. Complex. 21 (2014)
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
Debates with small transparent quantum verifiers. CoRR (2014)
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
Debates with Small Transparent Quantum Verifiers. Developments in Language Theory (2014)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Finite automata with advice tapes. CoRR (2013)
Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
Real-Time Vector Automata. FCT (2013)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Finite Automata with Advice Tapes. Developments in Language Theory (2013)
A. C. Cem Say, Abuzer Yakaryilmaz
Finite state verifiers with constant randomness. Electron. Colloquium Comput. Complex. 20 (2013)
Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
Real-Time Vector Automata CoRR (2013)
Abuzer Yakaryilmaz, A. C. Cem Say
Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines. Int. J. Found. Comput. Sci. 24 (8) (2013)
Abuzer Yakaryilmaz, A. C. Cem Say
Proving the Power of Postselection. Fundam. Informaticae 123 (1) (2013)
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
Quantum computation with write-only memory. Nat. Comput. 11 (1) (2012)
H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
Probabilistic verifiers for asymmetric debates CoRR (2012)
H. Gökalp Demirci, A. C. Cem Say
Checking generalized debates with small space and randomness. CoRR (2012)
A. C. Cem Say, Abuzer Yakaryilmaz
Finite State Verifiers with Constant Randomness. CiE (2012)
A. C. Cem Say, Abuzer Yakaryilmaz
Quantum Counter Automata. Int. J. Found. Comput. Sci. 23 (5) (2012)
A. C. Cem Say, Abuzer Yakaryilmaz
Computation with multiple CTCs of fixed length and width. Nat. Comput. 11 (4) (2012)
A. C. Cem Say, Özgür Yilmaz
Causes of Ineradicable Spurious Predictions in Qualitative Simulation CoRR (2011)
Abuzer Yakaryilmaz, A. C. Cem Say
Proving the power of postselection CoRR (2011)
A. C. Cem Say, Abuzer Yakaryilmaz
Computation with Narrow CTCs. UC (2011)
A. C. Cem Say, Abuzer Yakaryilmaz
Computation with narrow CTCs CoRR (2011)
Abuzer Yakaryilmaz, A. C. Cem Say
Tight bounds for the space complexity of nonregular language recognition by real-time machines CoRR (2011)
A. C. Cem Say, Abuzer Yakaryilmaz
Quantum counter automata CoRR (2011)
Abuzer Yakaryilmaz, A. C. Cem Say
Unbounded-error quantum computation with small space bounds. Inf. Comput. 209 (6) (2011)
Abuzer Yakaryilmaz, A. C. Cem Say
NP has log-space verifiers with fixed-size public quantum registers CoRR (2011)
Nuri Tasdemir, A. C. Cem Say
Models of Pushdown Automata with Reset. Developments in Language Theory (2011)
Abuzer Yakaryilmaz, A. C. Cem Say
Probabilistic and quantum finite automata with postselection CoRR (2011)
Abuzer Yakaryilmaz, A. C. Cem Say
Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. 10 (9&10) (2010)
Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say
A new family of nonstochastic languages. Inf. Process. Lett. 110 (10) (2010)
A. C. Cem Say, Abuzer Yakaryilmaz
Quantum function computation using sublogarithmic space (abstract & poster) CoRR (2010)
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
Quantum computation with devices whose contents are never read CoRR (2010)
Abuzer Yakaryilmaz, A. C. Cem Say
Unbounded-error quantum computation with small space bounds CoRR (2010)
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
Quantum Computation with Devices Whose Contents Are Never Read. UC (2010)
Abuzer Yakaryilmaz, A. C. Cem Say
Succinctness of two-way probabilistic and quantum finite automata. Discret. Math. Theor. Comput. Sci. 12 (4) (2010)
Abuzer Yakaryilmaz, A. C. Cem Say
Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR (2009)
Abuzer Yakaryilmaz, A. C. Cem Say
Quantum Finite Automata with One-Sided Unbounded Error CoRR (2009)
Abuzer Yakaryilmaz, A. C. Cem Say
Succinctness of two-way probabilistic and quantum finite automata CoRR (2009)
Abuzer Yakaryilmaz, A. C. Cem Say
Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. 410 (20) (2009)
Abuzer Yakaryilmaz, A. C. Cem Say
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error CoRR (2009)
Özgür Yilmaz, A. C. Cem Say
Causes of Ineradicable Spurious Predictions in Qualitative Simulation. J. Artif. Intell. Res. 27 (2006)
Evgeniya Khusnitdinova, A. C. Cem Say
Problems of Adiabatic Quantum Program Design. ISCIS (2006)
A. C. Cem Say, A. Kutsi Nircan
Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations. Autom. 41 (5) (2005)
Ugur Küçük, A. C. Cem Say
Improved Simulation of Quantum Random Walks. ISCIS (2005)
A. C. Cem Say, Özlem Çetinoglu, Seniz Demir, Faith Ögün
A Natural Language Processing Infrastructure for Turkish. COLING (2004)
Elton Ballhysa, A. C. Cem Say
Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm. ISCIS (2004)
F. Canan Pembe, A. C. Cem Say
A Linguistically Motivated Information Retrieval System for Turkish. ISCIS (2004)
A. C. Cem Say, H. Levent Akin
Sound and complete qualitative simulation is impossible. Artif. Intell. 149 (2) (2003)
Tolga Könik, A. C. Cem Say
Duration Consistency Filtering for Qualitative Simulation. Ann. Math. Artif. Intell. 38 (4) (2003)
A. C. Cem Say
Sound and Complete Qualitative Simulation Needs "Quantitative" Filtering. Ann. Math. Artif. Intell. 38 (4) (2003)
A. C. Cem Say
Problems in Representing Liquid Tanks with Monotonicity Constraints: A Case Study in Model-Imposed Limitations on the Coverage of Qualitative Simulators. Artif. Intell. Rev. 17 (4) (2002)
A. C. Cem Say
Understanding Arithmetic Problems in Turkish. Int. J. Pattern Recognit. Artif. Intell. 15 (2) (2001)
A. C. Cem Say
Improved Reasoning About Infinity Using Qualitative Simulation. Comput. Artif. Intell. 20 (5) (2001)
A. C. Cem Say
Making Use of Contradictory Behavior Information in Qualitative Reasoning. IEEE Trans. Pattern Anal. Mach. Intell. 21 (8) (1999)
A. C. Cem Say
L'Hôpital's Filter for QSIM. IEEE Trans. Pattern Anal. Mach. Intell. 20 (1) (1998)
A. C. Cem Say, Selahattin Kuru
Postdiction using reverse qualitative simulation. IEEE Trans. Syst. Man Cybern. Part A 27 (1) (1997)
A. C. Cem Say, Selahattin Kuru
Qualitative System Identification: Deriving Structure from Behavior. Artif. Intell. 83 (1) (1996)
A. C. Cem Say, Selahattin Kuru
Improved Filtering for the QSIM Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 15 (9) (1993)