Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems

In this paper, the stabilizability of discrete-time switched linear systems subject to constraints on the switching law is considered. The admissible switching sequences are given by the language generated by a nondeterministic finite state automaton. Constructive necessary and sufficient conditions for recurrent stabilizability are given and the exact relations with the existence of control Lyapunov functions and with general stabilizability are provided. The dependence of stabilizability on the automaton initial state is also proved.