5 citations · 12 across the 10 of their papers we have counts for
5 papers · 1 filter
On Word Representations and Embeddings in Complex Matrices
Paul C. Bell, George Kenison, Reino Niskanen +2
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose s…
Decision Questions for Probabilistic Automata on Small Alphabets
Paul C. Bell, Pavel Semukhin
We study the emptiness and -reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degr…
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…
Decidability of membership problems for flat rational subsets of and singular matrices
Volker Diekert, Igor Potapov, Pavel Semukhin
We consider membership problems for rational subsets of the semigroup of matrices over . For a semigroup , the rational subsets are def…
Vector Reachability Problem in
Igor Potapov, Pavel Semukhin
The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. Howe…