No polynomial algorithms are known for finding the coefficients of the characteristic polynomial and characteristic equation of a matrix in max- algebra. The following are proved: (1) The task of finding the max-algebraic characteristic polynomial for permutation matrices encoded using the lengths of their constituent cycles is NP-complete. (2) The task of finding the lowest order finite term of the max-algebraic characteristic polynomial for a $\{0,-\infty \}$ matrix can be converted to the assignment problem....

We consider the two-sided eigenproblem $A\otimes x=\lambda \otimes B\otimes x$ over max algebra. It is shown that any finite system of real intervals and points can be represented as spectrum of this eigenproblem.

In this paper, the static output feedback stabilization (SOFS) of deterministic finite automata (DFA) via the semi-tensor product (STP) of matrices is investigated. Firstly, the matrix expression of Moore-type automata is presented by using STP. Here the concept of the set of output feedback feasible events (OFFE) is introduced and expressed in the vector form, and the stabilization of DFA is defined in the sense of static output feedback (SOF) control. Secondly, SOFS problem of DFA is investigated...

We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.

We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.

This paper deals with output feedback synthesis for Timed Event Graphs (TEG) in dioid algebra. The feedback synthesis is done in order to (1) stabilize a TEG without decreasing its original production rate, (2) optimize the initial marking of the feedback, (3) delay as much as possible the tokens input.