proposition: Theorem dfa_complete_leq: eval A ≦ eval B.
proof: Proof. apply mx_scal_leq. rewrite R_u. rewrite <-(dotA _ R), R_M. rewrite <-2dotA, R_v. now rewrite dotA. Qed.
imports: kleene sums matrix_ext lset boolean lang nfa regex bmx rmx normalisation