Let our alphabet be = {a,b}. Define L6 = {a^fm: n 100, m < 100}...

 

Transcribed Image Text:

Let our alphabet be = {a,b}. Define L6 = {a^fm: n ≥ 100, m < 100} Explain your answers to the following questions: (a) Can you use the Pumping Lemma to show L6 is regular? (b) Can you use the Pumping Lemma to show Lá is not regular? Let our alphabet be = {a,b}. Define L6 = {a^fm: n ≥ 100, m < 100} Explain your answers to the following questions: (a) Can you use the Pumping Lemma to show L6 is regular? (b) Can you use the Pumping Lemma to show Lá is not regular? Let our alphabet be = {a,b}. Define L6 = {a^fm: n ≥ 100, m < 100} Explain your answers to the following questions: (a) Can you use the Pumping Lemma to show L6 is regular? (b) Can you use the Pumping Lemma to show Lá is not regular?

Answer rating: 100% (QA)

The image contains two main parts Firstly it defines an alphabet consisting of two symbols a b and a language L comprising of strings that follow the pattern ab where n is greater than or equal to 100 ... View the full answer