Abuzer Yakaryilmaz

According to our database, Abuzer Yakaryilmaz authored at least 93 papers between 2009 and 2023.

Collaborative distances:

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

2023

GAPs for Shallow Implementation of Quantum Finite Automata.

Mansur Ziiatdinov, Aliya Khadieva, Abuzer Yakaryilmaz

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022

Quantum advantage using high-dimensional twisted photons as quantum finite automata.

Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryilmaz, Robert Fickler

Quantum, 2022

Exact Affine Counter Automata.

Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2022

Framework for understanding quantum computing use cases from a multidisciplinary perspective and future research directions.

Dandison C. Ukpabi, Heikki Karjaluoto, Astrid Bötticher, Anastasija Nikiforova, Dragos Petrescu, Paulina Schindler, Visvaldis Valtenbergs, Lennard Lehmann, Abuzer Yakaryilmaz

CoRR, 2022

Classical and quantum Merlin-Arthur automata.

Abuzer Yakaryilmaz

CoRR, 2022

Real-valued affine automata compute beyond Turing machines.

Abuzer Yakaryilmaz

CoRR, 2022

Exclusive Affine Languages.

Abuzer Yakaryilmaz

Balt. J. Mod. Comput., 2022

Comparing Quantum Software Development Kits for Introductory Level Education.

Marija Scekic, Abuzer Yakaryilmaz

Balt. J. Mod. Comput., 2022

2021

Correction to: Computational limitations of affine automata and generalized affine automata.

Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz

Nat. Comput., 2021

Computational limitations of affine automata and generalized affine automata.

Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz

Nat. Comput., 2021

Error-Free Affine, Unitary, and Probabilistic OBDDs.

Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2021

State-efficient QFA Algorithm for Quantum Computers.

Özlem Salehi, Abuzer Yakaryilmaz

CoRR, 2021

Affine Automata Verifiers.

Aliya Khadieva, Abuzer Yakaryilmaz

Proceedings of the Unconventional Computation and Natural Computation, 2021

Quantum Logarithmic Space and Post-Selection.

François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz

Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

Implementing Quantum Finite Automata Algorithms on Noisy Devices.

Utku Birkan, Özlem Salehi, Viktor Olejár, Cem Nurlu, Abuzer Yakaryilmaz

Proceedings of the Computational Science - ICCS 2021, 2021

Improved Constructions for Succinct Affine Automata.

Abuzer Yakaryilmaz

Proceedings of the Descriptional Complexity of Formal Systems, 2021

Automata and quantum computing.

Andris Ambainis, Abuzer Yakaryilmaz

Proceedings of the Handbook of Automata Theory., 2021

2020

The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints.

Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz

Discret. Math. Theor. Comput. Sci., 2020

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

Uncountable Realtime Probabilistic Classes.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

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

New results on classical and quantum counter automata.

Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova

Discret. Math. Theor. Comput. Sci., 2019

Computational Limitations of Affine Automata.

Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz

Proceedings of the Unconventional Computation and Natural Computation, 2019

2018

Unary probabilistic and quantum automata on promise problems.

Aida Gainutdinova, Abuzer Yakaryilmaz

Quantum Inf. Process., 2018

Language recognition power and succinctness of affine automata.

Marcos Villagra, Abuzer Yakaryilmaz

Nat. Comput., 2018

Uncountable classical and quantum complexity classes.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

RAIRO Theor. Informatics Appl., 2018

Probabilistic verification of all languages.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

CoRR, 2018

New Size Hierarchies for Two Way Automata.

Kamil Khadiev, Rishat Ibrahimov, Abuzer Yakaryilmaz

CoRR, 2018

Postselecting probabilistic finite state recognizers and verifiers.

Maksims Dimitrijevs, Abuzer Yakaryilmaz

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

2017

Magic coins are useful for small-space quantum machines.

A. C. Cem Say, Abuzer Yakaryilmaz

Quantum Inf. Comput., 2017

On a Conjecture by Christian Choffrut.

Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2017

Inkdots as advice for finite automata.

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

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

Affine counter automata.

Masaki Nakanishi, Abuzer Yakaryilmaz

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

Exact Affine OBDDs.

Rishat Ibrahimov, Kamil Khadiev, Abuzer Yakaryilmaz

CoRR, 2017

On the Computational Power of Affine Automata.

Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz

Proceedings of the Language and Automata Theory and Applications, 2017

Nondeterministic Unitary OBDDs.

Aida Gainutdinova, Abuzer Yakaryilmaz

Proceedings of the Computer Science - Theory and Applications, 2017

2016

More on quantum, stochastic, and pseudo stochastic languages with few states.

Arseny M. Shur, Abuzer Yakaryilmaz

Nat. Comput., 2016

Debates with Small Transparent Quantum Verifiers.

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

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

New Results on the Minimum Amount of Useful Space.

Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz

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

Language recognition power and succintness of affine automata.

Marcos Villagra, Abuzer Yakaryilmaz

CoRR, 2016

Can one quantum bit separate any pair of words with zero-error?

Aleksandrs Belovs, Juan Andrés Montoya, Abuzer Yakaryilmaz

CoRR, 2016

Decision Problems on Unary Probabilistic and Quantum Automata.

Mika Hirvensalo, Abuzer Yakaryilmaz

Balt. J. Mod. Comput., 2016

Looking for Pairs that Hard to Separate: A Quantum Approach.

Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz

Proceedings of the Implementation and Application of Automata, 2016

Two-way frequency finite automata.

Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Affine Computation and Affine Automaton.

Alejandro Díaz-Caro, Abuzer Yakaryilmaz

Proceedings of the Computer Science - Theory and Applications, 2016

2015

Classical Automata on Promise Problems.

Viliam Geffert, Abuzer Yakaryilmaz

Discret. Math. Theor. Comput. Sci., 2015

Inkdots as advice to small-space machines.

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

CoRR, 2015

Automata and Quantum Computing.

Andris Ambainis, Abuzer Yakaryilmaz

CoRR, 2015

Classical and Quantum Counter Automata on Promise Problems.

Masaki Nakanishi, Abuzer Yakaryilmaz

Proceedings of the Implementation and Application of Automata, 2015

On discerning strings with finite automata.

Abuzer Yakaryilmaz, J. Andres Montoya

Proceedings of the 2015 Latin American Computing Conference, 2015

2014

Finite Automata with Advice Tapes.

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

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

The Complexity of Debate Checking.

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

Electron. Colloquium Comput. Complex., 2014

Implications of Quantum Automata for Contextuality.

Jibran Rashid, Abuzer Yakaryilmaz

Proceedings of the Implementation and Application of Automata, 2014

Unary Languages Recognized by Two-Way One-Counter Automata.

Marzio De Biasi, Abuzer Yakaryilmaz

Proceedings of the Implementation and Application of Automata, 2014

Quantum, Stochastic, and Pseudo Stochastic Languages with Few States.

Arseny M. Shur, Abuzer Yakaryilmaz

Proceedings of the Unconventional Computation and Natural Computation, 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

The Minimum Amount of Useful Space: New Results and New Directions.

Klaus Reinhardt, Abuzer Yakaryilmaz

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.

Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz

Proceedings of the Descriptional Complexity of Formal Systems, 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

Log-space counter is useful for unary languages by help of a constant-size quantum register.

Abuzer Yakaryilmaz

CoRR, 2013

Non-trivial unary languages recognized by two-way one-counter machines.

Marzio De Biasi, Abuzer Yakaryilmaz

CoRR, 2013

Real-Time Vector Automata.

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

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

Quantum Alternation.

Abuzer Yakaryilmaz

Proceedings of the Computer Science - Theory and Applications, 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

Superiority of one-way and realtime quantum machines.

Abuzer Yakaryilmaz

RAIRO Theor. Informatics Appl., 2012

Superiority of exact quantum automata for promise problems.

Andris Ambainis, Abuzer Yakaryilmaz

Inf. Process. Lett., 2012

Quantum Counter Automata.

A. C. Cem Say, Abuzer Yakaryilmaz

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

Public-qubits versus private-coins.

Abuzer Yakaryilmaz

Electron. Colloquium Comput. Complex., 2012

One-counter verifiers for decidable languages.

Abuzer Yakaryilmaz

Electron. Colloquium Comput. Complex., 2012

Probabilistic verifiers for asymmetric debates

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

CoRR, 2012

Turing-equivalent automata using a fixed-size quantum memory

Abuzer Yakaryilmaz

CoRR, 2012

2011

Classical and quantum computation with small space bounds (Az belleğe sahip klasik ve kuantum hesaplama)

Abuzer Yakaryilmaz

PhD thesis, 2011

Unbounded-error quantum computation with small space bounds.

Abuzer Yakaryilmaz, A. C. Cem Say

Inf. Comput., 2011

Superiority of one-way and realtime quantum machines and new directions (extended abstract)

Abuzer Yakaryilmaz

CoRR, 2011

Probabilistic and quantum finite automata with postselection

Abuzer Yakaryilmaz, A. C. Cem Say

CoRR, 2011

Classical and quantum computation with small space bounds (PhD thesis)

Abuzer Yakaryilmaz

CoRR, 2011

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

Abuzer Yakaryilmaz, A. C. Cem Say

CoRR, 2011

Exact quantum algorithms for promise problems in automata theory

Abuzer Yakaryilmaz

CoRR, 2011

Computation with Narrow CTCs.

A. C. Cem Say, Abuzer Yakaryilmaz

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

Superiority of One-Way and Realtime Quantum Machines and New Directions.

Abuzer Yakaryilmaz

Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 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