Thanks Question 8 The following question is given Use the Pumping Lemma with len

Question

Thanks

Question 8 The following question is given Use the Pumping Lemma with length to prove that the following language is non-regular L (ababnt, where n e (1, 2, 3, ...)) The solution to this question is partly given as follows Assume L # {aba,b"+1, where n E {1, 2, 3, )) is regular. Then there exists an FA with, say, k states, that accepts L. Let w ab2a*b**1 be a word in L. According to the pumping lemma with length, w may be written as w= xyz such that length(x)+ length(y) s k AND length(y)>0 How many possible choices for y are there to check? 1. 6 2. 5 3. 4 4. 3

Explanation / Answer

8)
Answer: 3
Explanation:
to prove ab^2a^nb^(n+1) is non regular...
in the string w = ab^2a^kb^(k+1)
for y, we must either a^k or b^k+1 or both...because they are making the language non regular..
so..to prove it non regular we have 3 possible chances...

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.