A. C. Cem Say

According to our database, A. C. Cem Say authored at least 69 papers between 1992 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Energy complexity of regular languages.

Firat Kiyak, A. C. Cem Say

Theor. Comput. Sci., January, 2024

2023

Real-time, constant-space, constant-randomness verifiers.

M. Utkan Gezer, Özdeniz Dolu, Nevzat Ersoy, A. C. Cem Say

Theor. Comput. Sci., October, 2023

Read-once machines and the thermodynamic complexity of Maxwell's demons.

Firat Kiyak, A. C. Cem Say

CoRR, 2023

Energy Complexity of Computation.

Ahmet Celal Cem Say

Proceedings of the Reversible Computation - 15th International Conference, 2023

Finite State Verifiers with Both Private and Public Coins.

M. Utkan Gezer, A. C. Cem Say

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

Advice hierarchies among finite automata.

Ahmet Bilal Uçan, A. C. Cem Say

Inf. Comput., 2022

Constant-space, constant-randomness verifiers with arbitrarily small error.

M. Utkan Gezer, A. C. Cem Say

Inf. Comput., 2022

Energy Complexity of Regular Language Recognition.

Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say

Proceedings of the Implementation and Application of Automata, 2022

2019

Alternating, private alternating, and quantum alternating realtime automata.

Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz

Log. Methods Comput. Sci., 2019

New Results on Vector and Homing Vector Automata.

Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say

Int. J. Found. Comput. Sci., 2019

2018

Language classes associated with automata over matrix groups.

Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say

RAIRO Theor. Informatics Appl., 2018

Extended finite automata and decision problems for matrix semigroups.

Özlem Salehi, Ahmet Celal Cem Say

CoRR, 2018

2017

Magic coins are useful for small-space quantum machines.

A. C. Cem Say, Abuzer Yakaryilmaz

Quantum Inf. Comput., 2017

Inkdots as advice for finite automata.

Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz

Discret. Math. Theor. Comput. Sci., 2017

Generalized Results on Monoids as Memory.

Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

2016

Homing vector automata.

Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro

RAIRO Theor. Informatics Appl., 2016

Debates with Small Transparent Quantum Verifiers.

Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci

Int. J. Found. Comput. Sci., 2016

The weakness of CTC qubits and the power of approximate counting.

Ryan O'Donnell, A. C. Cem Say

Electron. Colloquium Comput. Complex., 2016

2015

Inkdots as advice to small-space machines.

Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz

CoRR, 2015

Homing vector automata.

Özlem Salehi, A. C. Cem Say

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Optimal Bounds for Estimating Entropy with PMF Queries.

Cafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Finite Automata with Advice Tapes.

Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2014

One time-travelling bit is as good as logarithmically many.

Ryan O'Donnell, A. C. Cem Say

Electron. Colloquium Comput. Complex., 2014

The Complexity of Debate Checking.

H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz

Electron. Colloquium Comput. Complex., 2014

Classical and quantum realtime alternating automata.

H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

One Time-traveling Bit is as Good as Logarithmically Many.

Ryan O'Donnell, A. C. Cem Say

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Quantum Finite Automata: A Modern Introduction.

A. C. Cem Say, Abuzer Yakaryilmaz

Proceedings of the Computing with New Resources, 2014

2013

Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines.

Abuzer Yakaryilmaz, A. C. Cem Say

Int. J. Found. Comput. Sci., 2013

Proving the Power of Postselection.

Abuzer Yakaryilmaz, A. C. Cem Say

Fundam. Informaticae, 2013

Finite state verifiers with constant randomness.

A. C. Cem Say, Abuzer Yakaryilmaz

Electron. Colloquium Comput. Complex., 2013

Real-Time Vector Automata.

Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Quantum computation with write-only memory.

Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan

Nat. Comput., 2012

Computation with multiple CTCs of fixed length and width.

A. C. Cem Say, Abuzer Yakaryilmaz

Nat. Comput., 2012

Quantum Counter Automata.

A. C. Cem Say, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2012

Probabilistic verifiers for asymmetric debates

H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz

CoRR, 2012

Checking generalized debates with small space and randomness.

H. Gökalp Demirci, A. C. Cem Say

CoRR, 2012

2011

Unbounded-error quantum computation with small space bounds.

Abuzer Yakaryilmaz, A. C. Cem Say

Inf. Comput., 2011

Probabilistic and quantum finite automata with postselection

Abuzer Yakaryilmaz, A. C. Cem Say

CoRR, 2011

NP has log-space verifiers with fixed-size public quantum registers

Abuzer Yakaryilmaz, A. C. Cem Say

CoRR, 2011

Computation with Narrow CTCs.

A. C. Cem Say, Abuzer Yakaryilmaz

Proceedings of the Unconventional Computation - 10th International Conference, 2011

Models of Pushdown Automata with Reset.

Nuri Tasdemir, A. C. Cem Say

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Languages recognized by nondeterministic quantum finite automata.

Abuzer Yakaryilmaz, A. C. Cem Say

Quantum Inf. Comput., 2010

A new family of nonstochastic languages.

Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say

Inf. Process. Lett., 2010

Succinctness of two-way probabilistic and quantum finite automata.

Abuzer Yakaryilmaz, A. C. Cem Say

Discret. Math. Theor. Comput. Sci., 2010

Quantum function computation using sublogarithmic space (abstract & poster)

A. C. Cem Say, Abuzer Yakaryilmaz

CoRR, 2010

Quantum Computation with Devices Whose Contents Are Never Read.

Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan

Proceedings of the Unconventional Computation - 9th International Conference, 2010

2009

Efficient probability amplification in two-way quantum finite automata.

Abuzer Yakaryilmaz, A. C. Cem Say

Theor. Comput. Sci., 2009

Quantum Finite Automata with One-Sided Unbounded Error

Abuzer Yakaryilmaz, A. C. Cem Say

CoRR, 2009

Language Recognition by Generalized Quantum Finite Automata with Unbounded Error

Abuzer Yakaryilmaz, A. C. Cem Say

CoRR, 2009

Languages Recognized with Unbounded Error by Quantum Finite Automata.

Abuzer Yakaryilmaz, A. C. Cem Say

Proceedings of the Computer Science, 2009

2006

Causes of Ineradicable Spurious Predictions in Qualitative Simulation.

Özgür Yilmaz, A. C. Cem Say

J. Artif. Intell. Res., 2006

Problems of Adiabatic Quantum Program Design.

Evgeniya Khusnitdinova, A. C. Cem Say

Proceedings of the Computer and Information Sciences, 2006

2005

Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations.

A. C. Cem Say, A. Kutsi Nircan

Autom., 2005

Improved Simulation of Quantum Random Walks.

Ugur Küçük, A. C. Cem Say

Proceedings of the Computer and Information Sciences, 2005

2004

A Linguistically Motivated Information Retrieval System for Turkish.

F. Canan Pembe, A. C. Cem Say

Proceedings of the Computer and Information Sciences, 2004

Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm.

Elton Ballhysa, A. C. Cem Say

Proceedings of the Computer and Information Sciences, 2004

A Natural Language Processing Infrastructure for Turkish.

A. C. Cem Say, Özlem Çetinoglu, Seniz Demir, Faith Ögün

Proceedings of the COLING 2004, 2004

2003

Sound and Complete Qualitative Simulation Needs "Quantitative" Filtering.

A. C. Cem Say

Ann. Math. Artif. Intell., 2003

Duration Consistency Filtering for Qualitative Simulation.

Tolga Könik, A. C. Cem Say

Ann. Math. Artif. Intell., 2003

Sound and complete qualitative simulation is impossible.

A. C. Cem Say, H. Levent Akin

Artif. Intell., 2003

2002

Problems in Representing Liquid Tanks with Monotonicity Constraints: A Case Study in Model-Imposed Limitations on the Coverage of Qualitative Simulators.

A. C. Cem Say

Artif. Intell. Rev., 2002

2001

Understanding Arithmetic Problems in Turkish.

A. C. Cem Say

Int. J. Pattern Recognit. Artif. Intell., 2001

Improved Reasoning About Infinity Using Qualitative Simulation.

A. C. Cem Say

Comput. Artif. Intell., 2001

1999

Making Use of Contradictory Behavior Information in Qualitative Reasoning.

A. C. Cem Say

IEEE Trans. Pattern Anal. Mach. Intell., 1999

1998

L'Hôpital's Filter for QSIM.

A. C. Cem Say

IEEE Trans. Pattern Anal. Mach. Intell., 1998

1997

Postdiction using reverse qualitative simulation.

A. C. Cem Say, Selahattin Kuru

IEEE Trans. Syst. Man Cybern. Part A, 1997

1996

Qualitative System Identification: Deriving Structure from Behavior.

A. C. Cem Say, Selahattin Kuru

Artif. Intell., 1996

1993

Improved Filtering for the QSIM Algorithm.

A. C. Cem Say, Selahattin Kuru

IEEE Trans. Pattern Anal. Mach. Intell., 1993

1992

Qualitative system identification (Nitel sistem tanılama)

Ahmet Celal Cem Say

PhD thesis, 1992