Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Abuzer Yakaryılmaz"'
Publikováno v:
Quantum, Vol 6, p 752 (2022)
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an experimental impl
Externí odkaz:
https://doaj.org/article/c6309721d6b44372af080199113142e3
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Automata, Logic and Semantics (2020)
It is known that 2-state binary and 3-state unary probabilistic finite automata and 2-state unary quantum finite automata recognize uncountably many languages with cutpoints. These results have been obtained by associating each recognized language wi
Externí odkaz:
https://doaj.org/article/8d285fbc2e3a4d7692d6dae9d7ce0b4a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 205-218 (2017)
We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automat
Externí odkaz:
https://doaj.org/article/b4293d94289f491f8d8450827c98ff6d
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 4, Iss Automata, Logic and Semantics (2019)
We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter automaton and
Externí odkaz:
https://doaj.org/article/199239bc67e043a6b6f7fb01808448b2
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)
We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we present two eq
Externí odkaz:
https://doaj.org/article/4b597330cf854fc4b935070b3d33658f
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 3, Iss Automata, Logic and Semantics (2017)
We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite hierarchy of clas
Externí odkaz:
https://doaj.org/article/32c14d5301134f73999304c938c6109d
Autor:
Abuzer Yakaryılmaz
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783030934880
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd35263db542ab8d40b9e26642ac42c3
https://doi.org/10.1007/978-3-030-93489-7_16
https://doi.org/10.1007/978-3-030-93489-7_16
Autor:
Abuzer Yakaryılmaz
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783642385353
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be007f4c6a421bb034cd30bfbae4e326
https://doi.org/10.1007/978-3-642-38536-0_29
https://doi.org/10.1007/978-3-642-38536-0_29
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2020, Vol. 22 Issue 1, p1-12. 12p.