UN algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices

https://doi.org/10.1016/0304-3975(77)90006-8Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Cited by (0)