OAI/Combinatorics/EditApproximation/Probability/ExactSuffixDP.lean

GitHub source file

10 declarations, 0 contain sorry, 0 declared as axioms

An exact suffix dynamic program for the bounded initial input range. Each source row is computed once; its cells minimize over target cuts. The singleton prefix cost is the executable occurrence formula.

  1. theorem OAI.EditApproximation.natListMinimum_le_fallback line 18
  2. theorem OAI.EditApproximation.natListMinimum_le_member line 24
  3. theorem OAI.EditApproximation.natListMinimum_lower line 33
  4. theorem OAI.EditApproximation.exactSuffixDP_length line 44
  5. theorem OAI.EditApproximation.ofFn_nat_getD line 48
  6. theorem OAI.EditApproximation.edit_nil_left_exact line 53
  7. theorem OAI.EditApproximation.exactSuffixDP_spec line 59
  8. theorem OAI.EditApproximation.exactSuffixAnswer_eq_edit line 107
  9. theorem OAI.EditApproximation.exactSuffixAnswer_equal line 111
  10. theorem OAI.EditApproximation.exactSuffixAnswer_approximation line 116