On the Computational Complexity of Matrix Semigroup Problems
Paul C. Bell, Igor Potapov · Fundamenta Informaticae · 2012
Most computational problems for matrix semigroups and groups are inherently difficult to solve and even undecidable starting from dimension three. The questions about the decidability and complexity of problems for two-dimensional matrix semigroups r