| 2008 |
|---|
| 9 | EE | Rusins Freivalds,
Richard F. Bonner:
Quantum inductive inference by finite automata.
Theor. Comput. Sci. 397(1-3): 70-76 (2008) |
| 2001 |
|---|
| 8 | EE | Aija Berzina,
Richard F. Bonner:
Ambainis-Freivalds' Algorithm for Measure-Once Automata.
FCT 2001: 83-93 |
| 7 | EE | Richard F. Bonner,
Rusins Freivalds,
Maksim Kravtsev:
Quantum versus Probabilistic One-Way Finite Automata with Counter.
SOFSEM 2001: 181-190 |
| 2000 |
|---|
| 6 | | Louis Sanzogni,
Ringo Chan,
Richard F. Bonner:
Perceptrons with polynomial post-processing.
J. Exp. Theor. Artif. Intell. 12(1): 57-68 (2000) |
| 1999 |
|---|
| 5 | EE | Andris Ambainis,
Richard F. Bonner,
Rusins Freivalds,
Arnolds Kikusts:
Probabilities to Accept Languages by Quantum Finite Automata.
COCOON 1999: 174-183 |
| 4 | EE | Andris Ambainis,
Richard F. Bonner,
Rusins Freivalds,
Marats Golovkins,
Marek Karpinski:
Quantum Finite Multitape Automata.
SOFSEM 1999: 340-348 |
| 3 | EE | Andris Ambainis,
Richard F. Bonner,
Rusins Freivalds,
Arnolds Kikusts:
Probabilities to accept languages by quantum finite automata
CoRR quant-ph/9904066: (1999) |
| 1998 |
|---|
| 2 | EE | Richard F. Bonner,
Rusins Freivalds,
Janis Lapins,
Antra Lukjanska:
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages.
MFCS 1998: 213-219 |
| 1996 |
|---|
| 1 | | Louis Sanzogni,
Richard F. Bonner,
Ringo Chan:
Perceptrons with Polynomial Post-Processing.
ICTAI 1996: 472-474 |
