Question

Q4) Let L = {$a^n b^m$ : n $\geq$ 100,m $\leq$ 50}. (a) Can you use the pumping lemma to show that L is regular? (b) Can you use the pumping lemma to show that L is not regular? Explain your answers. Q5) Show that the language generated by the grammar S $\rightarrow$ aSS|b is not regular.

Name: q4 let l an bm n geq 100m leq 50 a can you use the pumping lemma to show that l is regular b can you use the pumping lemma to show that l is not regular explain your answers q5 show that the 16361
Uploaded: 2023-12-16T22:38:15-08:00
Duration: 2 min 32 s
Channel: Akash M
Description: q4 let l an bm n geq 100m leq 50 a can you use the pumping lemma to show that l is regular b can you use the pumping lemma to show that l is not regular explain your answers q5 show that the 16361

          Q4) Let L = {$a^n b^m$ : n $\geq$ 100,m $\leq$ 50}.
(a) Can you use the pumping lemma to show that L is regular?
(b) Can you use the pumping lemma to show that L is not regular?
Explain your answers.
Q5) Show that the language generated by the grammar S $\rightarrow$ aSS|b is not regular.

q4 let l an bm n geq 100m leq 50 a can you use the pumping lemma to show that l is regular b can you use the pumping lemma to show that l is not regular explain your answers q5 show that the 16361

Added by Beth B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

12/16/2023

Step 1

** **(a) Can you use the pumping lemma to show that L is regular?** The pumping lemma for regular languages is used to prove that a language is *not* regular. It cannot be used to prove that a language *is* regular. To show a language is regular, one typically Show more…

Show all steps

Thanks for your feedback!

Q4) Let L = {$a^n b^m$ : n $\geq$ 100,m $\leq$ 50}. (a) Can you use the pumping lemma to show that L is regular? (b) Can you use the pumping lemma to show that L is not regular? Explain your answers. Q5) Show that the language generated by the grammar S $\rightarrow$ aSS|b is not regular.