- Show that the language is not regular. L = {a^n b^m : n>m}
Asked
Active
Viewed 186 times
-1
RohitWagh
- 1,999
- 3
- 22
- 43
Tommy Harris
- 1
- 1
-
I mean how would I write out the answer or even accomplish it, it's my first experience with this – Tommy Harris Feb 24 '12 at 00:49
1 Answers
4
The Pumping Lemma is exactly what you're looking for.
How to use it? Try looking for some examples.
Eran Egozi
- 775
- 1
- 7
- 18