:
Can construct a TM generating pairs (i, j) in order of the sum i + j,
and among pairs of equal sum, in order of increasing i.
Output:
Correct Proof of Converse:
each word of L is generated exactly once.
In order of increasing size?