feat(computability/GNFA) - SemanticDiff

Commit

2 years ago

feat(computability/GNFA) Refactored GNFA proofs to use fintype.induction_empty_option instead of fin.

References

#14250 - feat(computability): prove equivalence of NFAs and regular expressions

Author

RussellEmerine

RussellEmerine

Parents

Loading