Periodicity of matrices in max-plus algebra is studied. A
necessary and sufficient condition is found for a given matrix to be
almost periodic. The period of a matrix is shown to be the least common
multiple of the high periods of all non-trivial highly connected
components in the corresponding digraph of A. A polynomial algorithm for
computing the exact value of the matrix period for a given matrix is
described.
|
|