PrintForm
Definitions
choice
1
Sections
AutomataTheory
Doc
At:
min
arg
unique
1
1
1.
f:
2.
n:
3.
k:
4.
f(n) = f(k)
5.
k < n
n-MinAr(f;n;n) = k-MinAr(f;k;k)
By:
Inst
Thm*
f:(
), n:
, i:
(n+1), j:
(n-i+1). f(n-i) = f(n)
MinAr(f;j+i;n) = MinAr(f;j;n-i)+i [f;n;n-k;k]
Generated subgoal:
1
f(n-(n-k)) = f(n)
About:
f(n-(n-k)) = f(n)
n-MinAr(f;n;n) = k-MinAr(f;k;k) 
f:(), n:, i:(n+1), j:(n-i+1).
f(n-i) = f(n) 
MinAr(f;j+i;n) = MinAr(f;j;n-i)+i
[f;n;n-k;k] f(n-(n-k)) = f(n)
