A sufficient condition for the boundedness of matrix products accepted by an automaton
Matthew Philippe, Raphaël M. Jungers · 2015
We study the boundedness of products of matrices associated with words in a regular language. This question naturally arises in the stability analysis of switching systems with constrained switching sequences.