Controllability, Reachability, and Stabilizability of Finite Automata: A Controllability Matrix Method

Abstract EN

This paper investigates the controllability, reachability, and stabilizability of finite automata by using the semitensor product of matrices.

Firstly, by expressing the states, inputs, and outputs as vector forms, an algebraic form is obtained for finite automata.

Secondly, based on the algebraic form, a controllability matrix is constructed for finite automata.

Thirdly, some necessary and sufficient conditions are presented for the controllability, reachability, and stabilizability of finite automata by using the controllability matrix.

Finally, an illustrative example is given to support the obtained new results.