4 citations · 11 across the 9 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.FL2019★ 4 cited
On Injectivity of Quantum Finite Automata
Paul C. Bell, Mika Hirvensalo
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of…
cs.DM2019★ 3 cited
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…
cs.FL2019★ 1 cited
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…