On reachability problems for low dimensional matrix semigroups.
arXiv: Computational Complexity(2019)
摘要
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 $mathrm{GL}(2,mathbb{Z})$ and of the Heisenberg group over rational numbers.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络