Abuzer Yakaryilmaz

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 65

Top Venues

CoRR

Int. J. Found. Comput. Sci.

UCNC

DCFS

Publications

Aliya Khadieva, Özlem Salehi, Abuzer Yakaryilmaz
A Representative Framework for Implementing Quantum Finite Automata on Real Devices. UCNC (2024)
Aliya Khadieva, Özlem Salehi, Abuzer Yakaryilmaz
A Representative Framework for Implementing Quantum Finite Automata on Real Devices. CoRR (2024)
Mansur Ziiatdinov, Aliya Khadieva, Abuzer Yakaryilmaz
GAPs for Shallow Implementation of Quantum Finite Automata. AFL (2023)
Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryilmaz, Robert Fickler
Quantum advantage using high-dimensional twisted photons as quantum finite automata. CoRR (2022)
Dandison C. Ukpabi, Heikki Karjaluoto, Astrid Bötticher, Anastasija Nikiforova, Dragos Petrescu, Paulina Schindler, Visvaldis Valtenbergs, Lennard Lehmann, Abuzer Yakaryilmaz
Framework for understanding quantum computing use cases from a multidisciplinary perspective and future research directions. CoRR (2022)
Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryilmaz, Robert Fickler
Quantum advantage using high-dimensional twisted photons as quantum finite automata. Quantum 6 (2022)
Marija Scekic, Abuzer Yakaryilmaz
Comparing Quantum Software Development Kits for Introductory Level Education. Balt. J. Mod. Comput. 10 (1) (2022)
Abuzer Yakaryilmaz
Real-valued affine automata compute beyond Turing machines. CoRR (2022)
Abuzer Yakaryilmaz
Classical and quantum Merlin-Arthur automata. CoRR (2022)
Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs, Abuzer Yakaryilmaz
Exact Affine Counter Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Abuzer Yakaryilmaz
Exclusive Affine Languages. Balt. J. Mod. Comput. 10 (3) (2022)
Abuzer Yakaryilmaz
Improved constructions for succinct affine automata. CoRR (2021)
Aliya Khadieva, Abuzer Yakaryilmaz
Affine Automata Verifiers. UCNC (2021)
Abuzer Yakaryilmaz
Improved Constructions for Succinct Affine Automata. DCFS (2021)
Utku Birkan, Özlem Salehi, Viktor Olejar, Cem Nurlu, Abuzer Yakaryilmaz
Implementing Quantum Finite Automata Algorithms on Noisy Devices. CoRR (2021)
Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz
Error-Free Affine, Unitary, and Probabilistic OBDDs. Int. J. Found. Comput. Sci. 32 (7) (2021)
Aliya Khadieva, Abuzer Yakaryilmaz
Affine automata verifiers. CoRR (2021)
François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
Quantum Logarithmic Space and Post-selection. CoRR (2021)
Utku Birkan, Özlem Salehi, Viktor Olejar, Cem Nurlu, Abuzer Yakaryilmaz
Implementing Quantum Finite Automata Algorithms on Noisy Devices. ICCS (6) (2021)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Correction to: Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20 (2) (2021)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20 (2) (2021)
Özlem Salehi, Abuzer Yakaryilmaz
State-efficient QFA Algorithm for Quantum Computers. CoRR (2021)
François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
Quantum Logarithmic Space and Post-Selection. TQC (2021)
Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. Discret. Math. Theor. Comput. Sci. 22 (1) (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)
Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova
New results on classical and quantum counter automata. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. CoRR (2019)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Computational Limitations of Affine Automata. CoRR (2019)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
Computational Limitations of Affine Automata. UCNC (2019)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable Realtime Probabilistic Classes. 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)
Marcos Villagra, Abuzer Yakaryilmaz
Language recognition power and succinctness of affine automata. Nat. Comput. 17 (2) (2018)
Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz
Error-Free Affine, Unitary, and Probabilistic OBDDs. DCFS (2018)
Aida Gainutdinova, Abuzer Yakaryilmaz
Unary probabilistic and quantum automata on promise problems. Quantum Inf. Process. 17 (2) (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Postselecting probabilistic finite state recognizers and verifiers. NCMA (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Postselecting probabilistic finite state recognizers and verifiers. CoRR (2018)
Kamil Khadiev, Rishat Ibrahimov, Abuzer Yakaryilmaz
New Size Hierarchies for Two Way Automata. CoRR (2018)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Probabilistic verification of all languages. CoRR (2018)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
On the Computational Power of Affine Automata. LATA (2017)
Rishat Ibrahimov, Kamil Khadiev, Abuzer Yakaryilmaz
Exact Affine OBDDs. CoRR (2017)
A. C. Cem Say, Abuzer Yakaryilmaz
Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. 17 (11&12) (2017)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable realtime probabilistic classes. CoRR (2017)
Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz
On a Conjecture by Christian Choffrut. Int. J. Found. Comput. Sci. 28 (5) (2017)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Inkdots as advice for finite automata. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Aida Gainutdinova, Abuzer Yakaryilmaz
Nondeterministic Unitary OBDDs. CSR (2017)
Masaki Nakanishi, Abuzer Yakaryilmaz
Affine counter automata. AFL (2017)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable Realtime Probabilistic Classes. DCFS (2017)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. CoRR (2016)
Mika Hirvensalo, Abuzer Yakaryilmaz
Decision problems on unary probabilistic and quantum automata. CoRR (2016)
Alejandro Díaz-Caro, Abuzer Yakaryilmaz
Affine computation and affine automaton. CoRR (2016)
Alejandro Díaz-Caro, Abuzer Yakaryilmaz
Affine Computation and Affine Automaton. CSR (2016)
Mika Hirvensalo, Abuzer Yakaryilmaz
Decision Problems on Unary Probabilistic and Quantum Automata. Balt. J. Mod. Comput. 4 (4) (2016)
Marcos Villagra, Abuzer Yakaryilmaz
Language Recognition Power and Succinctness of Affine Automata. UCNC (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)
Aida Gainutdinova, Abuzer Yakaryilmaz
Nondeterministic unitary OBDDs. CoRR (2016)
Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz
New Results on the Minimum Amount of Useful Space. Int. J. Found. Comput. Sci. 27 (2) (2016)
Aleksandrs Belovs, Juan Andrés Montoya, Abuzer Yakaryilmaz
Can one quantum bit separate any pair of words with zero-error? CoRR (2016)
Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz
Two-way frequency finite automata. NCMA (2016)
Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. NCMA (2016)
Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz
Looking for Pairs that Hard to Separate: A Quantum Approach. CIAA (2016)
Arseny M. Shur, Abuzer Yakaryilmaz
More on quantum, stochastic, and pseudo stochastic languages with few states. Nat. Comput. 15 (1) (2016)
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
On the computational power of affine automata. CoRR (2016)
Marcos Villagra, Abuzer Yakaryilmaz
Language recognition power and succintness of affine automata. CoRR (2016)
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
Inkdots as advice to small-space machines. CoRR (2015)
Masaki Nakanishi, Abuzer Yakaryilmaz
Classical and Quantum Counter Automata on Promise Problems. CIAA (2015)
Andris Ambainis, Abuzer Yakaryilmaz
Automata and Quantum Computing. CoRR (2015)
Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. Discret. Math. Theor. Comput. Sci. 17 (2) (2015)
Aida Gainutdinova, Abuzer Yakaryilmaz
Unary Probabilistic and Quantum Automata on Promise Problems. DLT (2015)
Abuzer Yakaryilmaz, J. Andres Montoya
On discerning strings with finite automata. CLEI (2015)
Aida Gainutdinova, Abuzer Yakaryilmaz
Unary probabilistic and quantum automata on promise problems. CoRR (2015)
H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
The Complexity of Debate Checking. Theory Comput. Syst. 57 (1) (2015)
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)
Marzio De Biasi, Abuzer Yakaryilmaz
Unary Languages Recognized by Two-Way One-Counter Automata. CIAA (2014)
Arseny M. Shur, Abuzer Yakaryilmaz
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. CoRR (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)
Jibran Rashid, Abuzer Yakaryilmaz
Implications of quantum automata for contextuality. CoRR (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)
Masaki Nakanishi, Abuzer Yakaryilmaz
Classical and quantum counter automata on promise problems. CoRR (2014)
Klaus Reinhardt, Abuzer Yakaryilmaz
The Minimum Amount of Useful Space: New Results and New Directions. Developments in Language Theory (2014)
Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. Electron. Colloquium Comput. Complex. 21 (2014)
Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. CoRR (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)
Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. DCFS (2014)
Viliam Geffert, Abuzer Yakaryilmaz
Classical automata on promise problems. CoRR (2014)
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
Debates with small transparent quantum verifiers. CoRR (2014)
Jibran Rashid, Abuzer Yakaryilmaz
Implications of Quantum Automata for Contextuality. CIAA (2014)
Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. DCFS (2014)
Klaus Reinhardt, Abuzer Yakaryilmaz
The minimum amount of useful space: New results and new directions. CoRR (2014)
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
Debates with Small Transparent Quantum Verifiers. Developments in Language Theory (2014)
Arseny M. Shur, Abuzer Yakaryilmaz
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. UCNC (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)
Abuzer Yakaryilmaz
Log-space counter is useful for unary languages by help of a constant-size quantum register. CoRR (2013)

Abuzer Yakaryilmaz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Abuzer Yakaryilmaz