Use the pumping lemma to show that each of these languages is nonregular: (i) {a n b

Question:

Use the pumping lemma to show that each of these languages is nonregular:
(i) {anbn+1} = {abb aabbb aaabbbb . . .}
(ii) {anbnan} = {aba aabbaa aaabbbaaa aaaabbbbaaaa . . .}
(iii) {anb2n} = {abb aabbbb aaabbbbbb . . .}
(iv) {anban} = {aba aabaa aaabaaa . . .}
(v) {anbnam where n = 0, 1 , 2, . . . and m = 0, 1 , 2, . . . } = {Λ a aa ab aaaaba . . . }

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: