I still confuse what is a regular language. I read some books, i know if language likes (a^n b^m| n,m>0), it will be regular language since n and m are not related. I know using pumping lemma can prove a language is regular or not, but for this one{a,b}*, i don't know how to do it.
Asked
Active
Viewed 34 times
