proposition: Lemma is_01_mx_str n (M: rmx n n): is_01_mx M -> is_01_mx (M^*).
proof: Proof. revert M. induction n; intros M HM. assumption. simpl. unfold mx_str_build. change (S n) with (1+n)%nat. ra_fold (mx_ops regex_ops regex_tt). auto 13 using is_01_str with mx_predicates. Qed.
imports: monoid regex lset boolean sups matrix_ext normalisation