3 citations · 4 across the 3 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2020
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…
cs.FL2019
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…
cs.FL2015
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…