Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. - Richard F. Bonner; Rusins Freivalds; Janis Lapins; Antra Lukjanska (MFCS, 1998)

Probabilities to Accept Languages by Quantum Finite Automata. - Andris Ambainis; Richard F. Bonner; Rusins Freivalds; Arnolds Kikusts (COCOON, 1999)

Quantum Finite Multitape Automata. - Andris Ambainis; Richard F. Bonner; Rusins Freivalds; Marats Golovkins; Marek Karpinski (SOFSEM, 1999)

Perceptrons with polynomial post-processing. - Louis Sanzogni; Ringo Chan; Richard F. Bonner (J. Exp. Theor. Artif. Intell., 2000)

Ambainis-Freivalds' Algorithm for Measure-Once Automata. - Aija Berzina; Richard F. Bonner (FCT, 2001)

Quantum versus Probabilistic One-Way Finite Automata with Counter. - Richard F. Bonner; Rusins Freivalds; Maksim Kravtsev (SOFSEM, 2001)

Quantum inductive inference by finite automata. - Rusins Freivalds; Richard F. Bonner (Theor. Comput. Sci., 2008)