The following program is more correct
than what I did on the board today.
w(i) is the ith string in the alphabet
CET is the stepper
f is the acceptor
the enumerator e(n) is
i := 0
m := 0
while m<=n do
j := 0
while j<=i and m<=n do
if CET(f,w(i-j),j) then m++
j++
i++
return(w(i-j))