We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group over rational numbers. Furthermore, we prove two decidability results for the Half-Space Reachability Problem. Namely, we show that this problem is decidable for sub-semigroups of GL(2,Z) and of the Heisenberg group over rational numbers
In this work, we consider membership problems in matrix semigroups. Using symbolic algorithms on wor...
This thesis deals with computational problems that are defined on matrix semigroups, which playa piv...
We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup gene...
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two a...
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two a...
© Igor Potapov and Pavel Semukhin. The decision problems on matrices were intensively studied for ma...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
This paper solves three open problems about the decidability of the vector and scalar reachability p...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
We consider the membership problem for matrix semigroups, which is the problem to decide whether a m...
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingu...
We consider the decidability of the membership problem for matrix-exponential semigroups: given k ∈ ...
We consider membership problems for rational sets in matrix semigroups. For a semigroup $M$, the rat...
In this work, we consider membership problems in matrix semigroups. Using symbolic algorithms on wor...
This thesis deals with computational problems that are defined on matrix semigroups, which playa piv...
We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup gene...
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two a...
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two a...
© Igor Potapov and Pavel Semukhin. The decision problems on matrices were intensively studied for ma...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
This paper solves three open problems about the decidability of the vector and scalar reachability p...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
The decision problems on matrices were intensively studied for many decades as matrix products play ...
We consider the membership problem for matrix semigroups, which is the problem to decide whether a m...
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingu...
We consider the decidability of the membership problem for matrix-exponential semigroups: given k ∈ ...
We consider membership problems for rational sets in matrix semigroups. For a semigroup $M$, the rat...
In this work, we consider membership problems in matrix semigroups. Using symbolic algorithms on wor...
This thesis deals with computational problems that are defined on matrix semigroups, which playa piv...
We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup gene...