3 citations · 4 across the 3 of their papers we have counts for
6 papers
Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
Paul C. Bell, Pavel Semukhin
We show the surprising result that the cutpoint isolation problem is decidable for Probabilistic Finite Automata (PFA) where input words are taken from a letter-bounded context-fre…
On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Paul C. Bell, Igor Potapov, Pavel Semukhin
We consider the following variant of the Mortality Problem: given matrices , does there exist nonnegative integers such tha…
Polynomially Ambiguous Probabilistic Automata on Restricted Languages
Paul C. Bell
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 st…
Towards Uniform Online Spherical Tessellations
Paul C. Bell, Igor Potapov
The problem of uniformly placing N 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 o…
Factorization in Formal Languages
Paul Bell, Daniel Reidenbach, Jeffrey Shallit
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of…
The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations
Paul Bell, Jean-Charles Delvenne, Raphael Jungers +1
We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. I…