18 citations · 28 across the 25 of their papers we have counts for
9 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…
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…
De Bruijn graphs and powers of
Oleksiy Kurganskyy, Igor Potapov
In this paper we consider the set of two-way infinite words over the alphabet with the integer left part and the fr…
On insertion-deletion systems over relational words
Igor Potapov, Olena Prianychnykova, Sergey Verlan
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal d…
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…
Weighted automata on infinite words in the context of Attacker-Defender games
Vesa Halava, Tero Harju, Reino Niskanen +1
We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted…