Abstract

A pure algebraic approach to linear automata theory is presented exhibiting the formal analogy to time discrete system theory. With respect to the homogeneous equations especially the eigenvalues of the systemmatrix and the stability of the states are investigated.