Searching for authors named "Gints Tervits" – sorted by Relevance.
-
Probabilistic and Quantum Automata for
- We use ideas from [Fr78] to construct a 2-tape quantum finite automaton for a language that was supposed to be crucially important to prove undecidability of emptiness problem for 2-tape quantum finite automata recognizing languages with fixed probability of the correct result exceeding 2 I
- Add To MetaCart

