the pumping dilemna: there are a sequence of s people tied to a railroad track, s drawn from regular language L. if s is big enough, you can pull a lever l, you can split s into subsequences x y z, such that the trolley only hits y, the subsequence x z is still in L.
