Not a true regular language (by the pumping lemma), and the reason you should care is regular languages can be made very fast: http://swtch.com/~rsc/regexp/rege

Not a true regular language (by the pumping lemma), and the reason you should care is regular languages can be made very fast: http://swtch.com/~rsc/regexp/regexp1.html http://swtch.com/~rsc/regexp/regexp1.html