mathlib3
feat(computability): prove equivalence of NFAs and regular expressions
#14250
Open
Overview
Commits
9
Changes
View On GitHub
Commits
  • feat(library): prove NFAs are equivalent to regular expressions
    RussellEmerine committed 3 years ago
  • doc(computability): documentation, TODOs, and questions
    RussellEmerine committed 3 years ago
  • style(computability): fix style and remove intermediate simp
    RussellEmerine committed 3 years ago
  • style(computability): fix long lines and braces
    RussellEmerine committed 3 years ago
  • feat(computability/regular_expressions): regex power operator
    RussellEmerine committed 3 years ago
  • substituted a simplification
    RussellEmerine committed 3 years ago
  • Merge branch 'master' into RussellEmerine/DFA_equivalent_regular_expression
    RussellEmerine committed 3 years ago
  • feat(computability/GNFA)
    RussellEmerine committed 3 years ago
  • Updated imports
    RussellEmerine committed 3 years ago
FAQ Terms Privacy Refunds Impressum
Loading