5.1. Identifying Non-regular Languages¶
5.1.2. Proving that a languages is not regular¶
1 / 13
Settings
<<<>>>
Our next step is to come up with a more formal proof that L2={anbn|n>0} is nonregular. We are going to do this using a Proof by Contradiction. So of course, the first step is to assume that L2 is regular, and show that this assumption causes a contradition.