18 citations · 28 across the 25 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.NA2015
Reachability problems for PAMs
Oleksiy Kurganskyy, Igor Potapov
Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentio…
cs.FL2015
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…
cs.FL2015
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…