Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Arnolds Kikusts"'
Autor:
Martin Beaudry, Marats Golovkins, Andris Ambainis, Denis Thérien, Arnolds Kikusts, Mark Mercer
Publikováno v:
Theory of Computing Systems. 39:165-188
We use tools from the algebraic theory of automata to investigate the class of languages recognized by two models of Quantum Finite Automata (QFA): Brodsky and Pippenger's end-decisive model (which we call BPQFA) and a new QFA model (which we call LQ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61e708e0ac90c08ef53fb74d7301e53f
https://doi.org/10.1007/s00224-005-1263-x
https://doi.org/10.1007/s00224-005-1263-x
Publikováno v:
STACS 2001 ISBN: 9783540416951
STACS
STACS
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3896b2615196ffeea37986343de68258
https://doi.org/10.1007/3-540-44693-1_7
https://doi.org/10.1007/3-540-44693-1_7
Autor:
Arnolds Kikusts, Andris Ambainis
Publikováno v:
MFCS
One of the properties of Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for severa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0903cb42c3fd977270392694bb2d076b