Abuzer Yakaryilmaz

149 papers B 1C 13Misc 5Journal 108Unranked 20

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Classical and quantum Merlin-Arthur automata. Quantum Inf. Process. Abuzer Yakaryilmaz
2025	J	`jnl`	QIP ⊆ AM(2QCFA). CoRR Abuzer Yakaryilmaz
2025	J	`jnl`	Real-Valued Affine Automata Compute Beyond Turing Machines. J. Autom. Lang. Comb. Abuzer Yakaryilmaz
2025	J	`jnl`	Two-way affine automata can verify every language. CoRR Zeyu Chen, Abuzer Yakaryilmaz
2024	—	`conf`	A Representative Framework for Implementing Quantum Finite Automata on Real Devices. UCNC Aliya Khadieva, Özlem Salehi, Abuzer Yakaryilmaz
2024	J	`jnl`	A Representative Framework for Implementing Quantum Finite Automata on Real Devices. CoRR Aliya Khadieva, Özlem Salehi, Abuzer Yakaryilmaz
2023	—	`conf`	GAPs for Shallow Implementation of Quantum Finite Automata. AFL Mansur Ziiatdinov, Aliya Khadieva, Abuzer Yakaryilmaz
2022	J	`jnl`	Classical and quantum Merlin-Arthur automata. CoRR Abuzer Yakaryilmaz
2022	J	`jnl`	Comparing Quantum Software Development Kits for Introductory Level Education. Balt. J. Mod. Comput. Marija Scekic, Abuzer Yakaryilmaz
2022	J	`jnl`	Exact Affine Counter Automata. Int. J. Found. Comput. Sci. Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs, Abuzer Yakaryilmaz
2022	J	`jnl`	Exclusive Affine Languages. Balt. J. Mod. Comput. Abuzer Yakaryilmaz
2022	J	`jnl`	Framework for understanding quantum computing use cases from a multidisciplinary perspective and future research directions. CoRR Dandison C. Ukpabi, Heikki Karjaluoto, Astrid Bötticher, Anastasija Nikiforova, Dragos Petrescu, Paulina Schindler, Visvaldis Valtenbergs, Lennard Lehmann, Abuzer Yakaryilmaz
2022	J	`jnl`	Quantum advantage using high-dimensional twisted photons as quantum finite automata. CoRR Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryilmaz, Robert Fickler
2022	J	`jnl`	Quantum advantage using high-dimensional twisted photons as quantum finite automata. Quantum Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryilmaz, Robert Fickler
2022	J	`jnl`	Real-valued affine automata compute beyond Turing machines. CoRR Abuzer Yakaryilmaz
2021	—	`conf`	Affine Automata Verifiers. UCNC Aliya Khadieva, Abuzer Yakaryilmaz
2021	J	`jnl`	Affine automata verifiers. CoRR Aliya Khadieva, Abuzer Yakaryilmaz
2021	—	`ch.`	Automata and quantum computing. Handbook of Automata Theory (II.) Andris Ambainis, Abuzer Yakaryilmaz
2021	J	`jnl`	Computational limitations of affine automata and generalized affine automata. Nat. Comput. Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
2021	J	`jnl`	Correction to: Computational limitations of affine automata and generalized affine automata. Nat. Comput. Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
2021	J	`jnl`	Error-Free Affine, Unitary, and Probabilistic OBDDs. Int. J. Found. Comput. Sci. Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz
2021	—	`conf`	Implementing Quantum Finite Automata Algorithms on Noisy Devices. ICCS (6) Utku Birkan, Özlem Salehi, Viktor Olejár, Cem Nurlu, Abuzer Yakaryilmaz
2021	J	`jnl`	Implementing Quantum Finite Automata Algorithms on Noisy Devices. CoRR Utku Birkan, Özlem Salehi, Viktor Olejár, Cem Nurlu, Abuzer Yakaryilmaz
2021	—	`conf`	Improved Constructions for Succinct Affine Automata. DCFS Abuzer Yakaryilmaz
2021	J	`jnl`	Improved constructions for succinct affine automata. CoRR Abuzer Yakaryilmaz
2021	—	`conf`	Quantum Logarithmic Space and Post-Selection. TQC François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
2021	J	`jnl`	Quantum Logarithmic Space and Post-selection. CoRR François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
2021	J	`jnl`	State-efficient QFA Algorithm for Quantum Computers. CoRR Özlem Salehi, Abuzer Yakaryilmaz
2020	J	`jnl`	The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. Discret. Math. Theor. Comput. Sci. Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz
2019	J	`jnl`	Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2019	—	`conf`	Computational Limitations of Affine Automata. UCNC Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
2019	J	`jnl`	Computational Limitations of Affine Automata. CoRR Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
2019	J	`jnl`	New Results on Vector and Homing Vector Automata. CoRR Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2019	J	`jnl`	New Results on Vector and Homing Vector Automata. Int. J. Found. Comput. Sci. Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2019	J	`jnl`	New results on classical and quantum counter automata. Discret. Math. Theor. Comput. Sci. Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova
2019	J	`jnl`	The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. CoRR Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz
2019	J	`jnl`	Uncountable Realtime Probabilistic Classes. Int. J. Found. Comput. Sci. Maksims Dimitrijevs, Abuzer Yakaryilmaz
2018	—	`conf`	Error-Free Affine, Unitary, and Probabilistic OBDDs. DCFS Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz
2018	J	`jnl`	Language recognition power and succinctness of affine automata. Nat. Comput. Marcos Villagra, Abuzer Yakaryilmaz
2018	J	`jnl`	New Size Hierarchies for Two Way Automata. CoRR Kamil Khadiev, Rishat Ibrahimov, Abuzer Yakaryilmaz
2018	—	`conf`	Postselecting probabilistic finite state recognizers and verifiers. NCMA Maksims Dimitrijevs, Abuzer Yakaryilmaz
2018	J	`jnl`	Postselecting probabilistic finite state recognizers and verifiers. CoRR Maksims Dimitrijevs, Abuzer Yakaryilmaz
2018	J	`jnl`	Probabilistic verification of all languages. CoRR Maksims Dimitrijevs, Abuzer Yakaryilmaz
2018	J	`jnl`	Unary probabilistic and quantum automata on promise problems. Quantum Inf. Process. Aida Gainutdinova, Abuzer Yakaryilmaz
2018	J	`jnl`	Uncountable classical and quantum complexity classes. RAIRO Theor. Informatics Appl. Maksims Dimitrijevs, Abuzer Yakaryilmaz
2017	—	`conf`	Affine counter automata. AFL Masaki Nakanishi, Abuzer Yakaryilmaz
2017	J	`jnl`	Exact Affine OBDDs. CoRR Rishat Ibrahimov, Kamil Khadiev, Abuzer Yakaryilmaz
2017	J	`jnl`	Inkdots as advice for finite automata. Discret. Math. Theor. Comput. Sci. Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2017	J	`jnl`	Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. A. C. Cem Say, Abuzer Yakaryilmaz
2017	Misc	`conf`	Nondeterministic Unitary OBDDs. CSR Aida Gainutdinova, Abuzer Yakaryilmaz
2017	J	`jnl`	On a Conjecture by Christian Choffrut. Int. J. Found. Comput. Sci. Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz
2017	C	`conf`	On the Computational Power of Affine Automata. LATA Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
2017	—	`conf`	Uncountable Realtime Probabilistic Classes. DCFS Maksims Dimitrijevs, Abuzer Yakaryilmaz
2017	J	`jnl`	Uncountable realtime probabilistic classes. CoRR Maksims Dimitrijevs, Abuzer Yakaryilmaz
2016	Misc	`conf`	Affine Computation and Affine Automaton. CSR Alejandro Díaz-Caro, Abuzer Yakaryilmaz
2016	J	`jnl`	Affine computation and affine automaton. CoRR Alejandro Díaz-Caro, Abuzer Yakaryilmaz
2016	J	`jnl`	Can one quantum bit separate any pair of words with zero-error? CoRR Aleksandrs Belovs, Juan Andrés Montoya, Abuzer Yakaryilmaz
2016	J	`jnl`	Debates with Small Transparent Quantum Verifiers. Int. J. Found. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2016	J	`jnl`	Decision Problems on Unary Probabilistic and Quantum Automata. Balt. J. Mod. Comput. Mika Hirvensalo, Abuzer Yakaryilmaz
2016	J	`jnl`	Decision problems on unary probabilistic and quantum automata. CoRR Mika Hirvensalo, Abuzer Yakaryilmaz
2016	—	`conf`	Language Recognition Power and Succinctness of Affine Automata. UCNC Marcos Villagra, Abuzer Yakaryilmaz
2016	J	`jnl`	Language recognition power and succintness of affine automata. CoRR Marcos Villagra, Abuzer Yakaryilmaz
2016	C	`conf`	Looking for Pairs that Hard to Separate: A Quantum Approach. CIAA Aleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz
2016	J	`jnl`	More on quantum, stochastic, and pseudo stochastic languages with few states. Nat. Comput. Arseny M. Shur, Abuzer Yakaryilmaz
2016	J	`jnl`	New Results on the Minimum Amount of Useful Space. Int. J. Found. Comput. Sci. Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz
2016	J	`jnl`	Nondeterministic unitary OBDDs. CoRR Aida Gainutdinova, Abuzer Yakaryilmaz
2016	J	`jnl`	On the computational power of affine automata. CoRR Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz
2016	—	`conf`	Two-way frequency finite automata. NCMA Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz
2016	—	`conf`	Uncountable classical and quantum complexity classes. NCMA Maksims Dimitrijevs, Abuzer Yakaryilmaz
2016	J	`jnl`	Uncountable classical and quantum complexity classes. CoRR Maksims Dimitrijevs, Abuzer Yakaryilmaz
2015	J	`jnl`	Automata and Quantum Computing. CoRR Andris Ambainis, Abuzer Yakaryilmaz
2015	J	`jnl`	Classical Automata on Promise Problems. Discret. Math. Theor. Comput. Sci. Viliam Geffert, Abuzer Yakaryilmaz
2015	C	`conf`	Classical and Quantum Counter Automata on Promise Problems. CIAA Masaki Nakanishi, Abuzer Yakaryilmaz
2015	J	`jnl`	Inkdots as advice to small-space machines. CoRR Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2015	C	`conf`	On discerning strings with finite automata. CLEI Abuzer Yakaryilmaz, J. Andres Montoya
2015	J	`jnl`	The Complexity of Debate Checking. Theory Comput. Syst. H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
2015	C	`conf`	Unary Probabilistic and Quantum Automata on Promise Problems. DLT Aida Gainutdinova, Abuzer Yakaryilmaz
2015	J	`jnl`	Unary probabilistic and quantum automata on promise problems. CoRR Aida Gainutdinova, Abuzer Yakaryilmaz
2014	—	`conf`	Classical Automata on Promise Problems. DCFS Viliam Geffert, Abuzer Yakaryilmaz
2014	J	`jnl`	Classical Automata on Promise Problems. Electron. Colloquium Comput. Complex. Viliam Geffert, Abuzer Yakaryilmaz
2014	J	`jnl`	Classical and quantum counter automata on promise problems. CoRR Masaki Nakanishi, Abuzer Yakaryilmaz
2014	—	`conf`	Classical and quantum realtime alternating automata. NCMA H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Classical and quantum realtime alternating automata. CoRR H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Classical automata on promise problems. CoRR Viliam Geffert, Abuzer Yakaryilmaz
2014	C	`conf`	Debates with Small Transparent Quantum Verifiers. Developments in Language Theory Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2014	J	`jnl`	Debates with small transparent quantum verifiers. CoRR Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2014	J	`jnl`	Finite Automata with Advice Tapes. Int. J. Found. Comput. Sci. Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Finite state verifiers with constant randomness Log. Methods Comput. Sci. A. C. Cem Say, Abuzer Yakaryilmaz
2014	C	`conf`	Implications of Quantum Automata for Contextuality. CIAA Jibran Rashid, Abuzer Yakaryilmaz
2014	J	`jnl`	Implications of quantum automata for contextuality. CoRR Jibran Rashid, Abuzer Yakaryilmaz
2014	J	`jnl`	Magic coins are useful for small-space quantum machines. CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Magic coins are useful for small-space quantum machines. Electron. Colloquium Comput. Complex. A. C. Cem Say, Abuzer Yakaryilmaz
2014	—	`conf`	Quantum Finite Automata: A Modern Introduction. Computing with New Resources A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Quantum finite automata: A modern introduction. CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2014	—	`conf`	Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. UCNC Arseny M. Shur, Abuzer Yakaryilmaz
2014	J	`jnl`	Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. CoRR Arseny M. Shur, Abuzer Yakaryilmaz
2014	J	`jnl`	The Complexity of Debate Checking. Electron. Colloquium Comput. Complex. H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
2014	C	`conf`	The Minimum Amount of Useful Space: New Results and New Directions. Developments in Language Theory Klaus Reinhardt, Abuzer Yakaryilmaz
2014	J	`jnl`	The minimum amount of useful space: New results and new directions. CoRR Klaus Reinhardt, Abuzer Yakaryilmaz
2014	C	`conf`	Unary Languages Recognized by Two-Way One-Counter Automata. CIAA Marzio De Biasi, Abuzer Yakaryilmaz
2014	—	`conf`	Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. DCFS Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
2014	J	`jnl`	Very narrow quantum OBDDs and width hierarchies for classical OBDDs. CoRR Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
2013	C	`conf`	Finite Automata with Advice Tapes. Developments in Language Theory Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2013	J	`jnl`	Finite automata with advice tapes. CoRR Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2013	J	`jnl`	Finite state verifiers with constant randomness. Electron. Colloquium Comput. Complex. A. C. Cem Say, Abuzer Yakaryilmaz
2013	J	`jnl`	Log-space counter is useful for unary languages by help of a constant-size quantum register. CoRR Abuzer Yakaryilmaz
2013	J	`jnl`	Non-trivial unary languages recognized by two-way one-counter machines. CoRR Marzio De Biasi, Abuzer Yakaryilmaz
2013	Misc	`conf`	One-Counter Verifiers for Decidable Languages. CSR Abuzer Yakaryilmaz
2013	J	`jnl`	Proving the Power of Postselection. Fundam. Informaticae Abuzer Yakaryilmaz, A. C. Cem Say
2013	Misc	`conf`	Quantum Alternation. CSR Abuzer Yakaryilmaz
2013	J	`jnl`	Real-Time Vector Automata CoRR Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2013	B	`conf`	Real-Time Vector Automata. FCT Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2013	J	`jnl`	Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines. Int. J. Found. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say
2012	J	`jnl`	Computation with multiple CTCs of fixed length and width. Nat. Comput. A. C. Cem Say, Abuzer Yakaryilmaz
2012	C	`conf`	Finite State Verifiers with Constant Randomness. CiE A. C. Cem Say, Abuzer Yakaryilmaz
2012	J	`jnl`	One-counter verifiers for decidable languages CoRR Abuzer Yakaryilmaz
2012	J	`jnl`	One-counter verifiers for decidable languages. Electron. Colloquium Comput. Complex. Abuzer Yakaryilmaz
2012	J	`jnl`	Probabilistic verifiers for asymmetric debates CoRR H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
2012	J	`jnl`	Public-qubits versus private-coins. Electron. Colloquium Comput. Complex. Abuzer Yakaryilmaz
2012	J	`jnl`	Quantum Counter Automata. Int. J. Found. Comput. Sci. A. C. Cem Say, Abuzer Yakaryilmaz
2012	J	`jnl`	Quantum computation with write-only memory. Nat. Comput. Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2012	J	`jnl`	Superiority of exact quantum automata for promise problems. Inf. Process. Lett. Andris Ambainis, Abuzer Yakaryilmaz
2012	J	`jnl`	Superiority of one-way and realtime quantum machines. RAIRO Theor. Informatics Appl. Abuzer Yakaryilmaz
2012	J	`jnl`	Turing-equivalent automata using a fixed-size quantum memory CoRR Abuzer Yakaryilmaz
2011	—	`—`	Classical and quantum computation with small space bounds (Az belleğe sahip klasik ve kuantum hesaplama) Abuzer Yakaryilmaz
2011	J	`jnl`	Classical and quantum computation with small space bounds (PhD thesis) CoRR Abuzer Yakaryilmaz
2011	C	`conf`	Computation with Narrow CTCs. UC A. C. Cem Say, Abuzer Yakaryilmaz
2011	J	`jnl`	Computation with narrow CTCs CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2011	J	`jnl`	Exact quantum algorithms for promise problems in automata theory CoRR Abuzer Yakaryilmaz
2011	J	`jnl`	NP has log-space verifiers with fixed-size public quantum registers CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Probabilistic and quantum finite automata with postselection CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Proving the power of postselection CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Quantum counter automata CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2011	—	`conf`	Superiority of One-Way and Realtime Quantum Machines and New Directions. NCMA Abuzer Yakaryilmaz
2011	J	`jnl`	Superiority of one-way and realtime quantum machines and new directions (extended abstract) CoRR Abuzer Yakaryilmaz
2011	J	`jnl`	Tight bounds for the space complexity of nonregular language recognition by real-time machines CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Unbounded-error quantum computation with small space bounds. Inf. Comput. Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	A new family of nonstochastic languages. Inf. Process. Lett. Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. Abuzer Yakaryilmaz, A. C. Cem Say
2010	C	`conf`	Quantum Computation with Devices Whose Contents Are Never Read. UC Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2010	J	`jnl`	Quantum computation with devices whose contents are never read CoRR Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2010	J	`jnl`	Quantum function computation using sublogarithmic space (abstract & poster) CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2010	J	`jnl`	Succinctness of two-way probabilistic and quantum finite automata. Discret. Math. Theor. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	Unbounded-error quantum computation with small space bounds CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Language Recognition by Generalized Quantum Finite Automata with Unbounded Error CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2009	Misc	`conf`	Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Quantum Finite Automata with One-Sided Unbounded Error CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Succinctness of two-way probabilistic and quantum finite automata CoRR Abuzer Yakaryilmaz, A. C. Cem Say