“…When the switchings are arbitrary, one can take the switched system (1.1) as a free semigroup action G generated by G, i.e., G = n∈N G n , G n = {f ωn · · · f ω 1 | ω i ∈ I, i = 1, · · · , n}. There are many works for dynamical systems under semigroup actions: topological entropy [4,6,30,31]; transitivity, mixing, and chaos [7,28,29,33,27,12]; sensitivity [14,24]; shadowing property [2,12]; specification property [25,12]; we refer the reader to the references therein for other related investigations.…”