加载中…
We consider semigroup algorithmic problems in the Special Affine group , which is the group of affine transformations of the lattice that preserve orientation. Our paper focuses on two decision problems introduced by Choffrut and Karhumäki (2005): the Identity Problem (does a semigroup contain a neutral element?) and the Group Problem (is a semigroup a group?) for finitely generated sub-semigroups of . We show that both problems are decidable and NP-complete. Since , our result extends that of Bell, Hirvensalo and Potapov (2017) on the NP-completeness of both problems in , and contributes a first step towards the open problems in .

生成讲解博客的中文版本

生成AI智能校验的中文版本