  We present a simple new method for proving that languages are not regular. We
prove the correctness of the method, illustrate the ease of using the method on
well-known examples of nonregular languages, and prove two additional theorems
on the power and limitations of the method.
