proposition: Lemma minimize_correct (A : dfa) : dfa_lang (minimize A) =i dfa_lang A.
proof: Proof. move => x. by rewrite collapse_correct dfa_prune_correct. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype path fingraph finfun finset generic_quotient) RegLang(misc languages dfa)