proposition: Theorem eval_det: eval det ≡ eval nfa.
proof: Proof. apply mx_scal_weq. rewrite det_uX. rewrite <-(dotA _ X), det_MX. rewrite <-(dotA _ _ v), <-(dotA _ X), det_Xv. now rewrite dotA. Qed.
imports: kleene sums matrix_ext lset boolean lang nfa regex bmx rmx normalisation