Abstract
There are several well-known techniques for proving non-regularity of a given language, e.g., Myhill-Nerode theorem or Pumping lemma. In this paper, we propose a new technique for proving non-regularity that is completely different from all previously known techniques. Our technique is based on a measure of a language, and provides a geometric intuition for the non-regularity. We demonstrate, with a few examples, the usefulness of our technique. Further, we pose some future work and conjectures which generalize our technique.
