@inproceedings{3f621469d394469eaa5476ed609df76e,
title = "Probabilities to accept languages by quantum finite automata",
abstract = "We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.",
author = "Andris Ambainis and Richard Bonner and Rūsiņ{\v s} Freivalds and Arnolds Ķikusts",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th Annual International Conference on Computing and Combinatorics, COCOON 1999 ; Conference date: 26-07-1999 Through 28-07-1999",
year = "1999",
doi = "10.1007/3-540-48686-0\_17",
language = "English",
isbn = "3540662006",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "174--183",
editor = "Shin-ichi Nakano and Hideki Imai and D.T. Lee and Takeshi Tokuyama and Takao Asano",
booktitle = "Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings",
address = "Germany",
}