Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Gökalp Demirci"'
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:
Proceedings of the 19th International Conference on Mining Software Repositories.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b0012786bc8582fe8b774f2614f08dd
https://doi.org/10.1145/3524842.3528518
https://doi.org/10.1145/3524842.3528518
Publikováno v:
International Journal of Foundations of Computer Science. 27:283-300
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05d187bc1fde6c8fff814122f812a624
https://doi.org/10.1142/s0129054116400104
https://doi.org/10.1142/s0129054116400104
Publikováno v:
Theory of Computing Systems. 57:36-80
We study probabilistic debate checking, where a silent resource-bounded verifier reads a dialogue about the membership of a given string in the language under consideration between a prover and a refuter. We consider debates of partial and zero infor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d8fa26c1ec16651510c98024698a979
https://doi.org/10.1007/s00224-014-9547-7
https://doi.org/10.1007/s00224-014-9547-7
Publikováno v:
Developments in Language Theory ISBN: 9783319096971
Developments in Language Theory
Developments in Language Theory
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38f6583291bc800ea8e254e66ea8ef7c
https://doi.org/10.1007/978-3-319-09698-8_29
https://doi.org/10.1007/978-3-319-09698-8_29
