We are given the language, L = {0'1'2 | i, j, k 0, k #1...

Transcribed Image Text:

We are given the language, L = {0'1'2 | i, j, k ≥ 0, k #1 or i = j}. (a) 5 points Without using the pumping lemma, argue that L is not regular. (b) 5 points Show that the pumping lemma for regular languages applies to L. (c) 5 points What conclusion can you draw about the pumping lemma from the above ob- servations? We are given the language, L = {0'1'2 | i, j, k ≥ 0, k #1 or i = j}. (a) 5 points Without using the pumping lemma, argue that L is not regular. (b) 5 points Show that the pumping lemma for regular languages applies to L. (c) 5 points What conclusion can you draw about the pumping lemma from the above ob- servations?

Answer rating: 100% (QA)

a To argue that language L is not regular without using the pumping lemma we can use the properties of regular languages Regular languages are closed under certain operations such as union concatenati... View the full answer