Searching for authors named "Arnolds Kikusts" – sorted by Relevance.
-
Exact Results for Accepting Probabilities of Quantum Automata
- One of 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 achievable by QFAs for several languages. In particular, we show that any languag
- Cited by 5 (1 self) – Add To MetaCart
-
On the Class of Languages Recognizable By 1-Way Quantum Finite Automata
- It is well known that quantum finite automata (QFA) cannot recognize all regular languages. However nobody knows what languages can be recognized by a 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
- Cited by 5 (0 self) – Add To MetaCart

