"Connections between words and matrices".

There is well known connection between words and integer matrices known already almost hundred years stating that free monoids (finitely or countably generated) can be embedded into the multiplicatice semigroup of matrices. This allows in one hand to conclude simple undecidablity results for matrices, and on the other hand some weak dimension properties for words. These and related results are analyzed in this lecture.