Let S be a finite set of matrices over a commutative field K. We give here an algorithm which decides whether the matrix semigroup H generated by S is finite; and in that case, our algorithm computes the cardinality of H.
In other words, we can decide by an effective procedure whether a K-automaton is a finite automaton.