Updated: Sun Jul  6 19:30:03 PDT 2003

Hint: Look at Problems 1.34 and 1.35 on page 89 of your textbook.
Can you prove that the set of all unary numerals for the numbers from
0 to 419 is pairwise distinguishable by L?

Another hint: What would a program emulating this DFA have to remember?