1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.FA2013
Operators that coerce the surjectivity of convolution
Richard F. Bonner
Considered are operators that leave the set of non-invertible (in the sense of Ehrenpreis) distributions stable. They simultaneously generalise the operation of convolution by a di…
quant-ph1999
Quantum finite multitape automata
Andris Ambainis, Richard Bonner, Rusins Freivalds +2
Quantum finite automata were introduced by C.Moore, J.P. Crutchfield, and by A.Kondacs and J.Watrous. This notion is not a generalization of the deterministic finite automata. More…
quant-ph1999★ 1 cited
Probabilities to accept languages by quantum finite automata
Andris Ambainis, Richard Bonner, Rusins Freivalds +1
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 c…