Skip to main content

Research Repository

Advanced Search

All Outputs (2)

Polynomially ambiguous probabilistic automata on restricted languages (2022)
Journal Article
Bell, P. (2022). Polynomially ambiguous probabilistic automata on restricted languages. Journal of Computer and System Sciences, 53 - 65. https://doi.org/10.1016/j.jcss.2022.02.002

We consider the computability and complexity of decision questions for Probabilistic Finite Automata (PFA) with sub-exponential ambiguity. We show that the emptiness problem for strict and non-strict cut-points of polynomially ambiguous commutative P... Read More about Polynomially ambiguous probabilistic automata on restricted languages.

Towards Uniform Online Spherical Tessellations (2022)
Journal Article
Bell, P., & Potapov, I. (2022). Towards Uniform Online Spherical Tessellations. Discrete and Computational Geometry, 67(4), 1124-1146. https://doi.org/10.1007/s00454-022-00384-x

The problem of uniformly placing points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating uniform rotations... Read More about Towards Uniform Online Spherical Tessellations.