Updated: Sat Aug 30 18:01:27 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 binary strings of length 5 is pairwise
distinguishable by L?  [CORRECTION]

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