Hello, I need help in solving the highlighted question(b) for my \" Theory of Co

Question

Hello,

I need help in solving the highlighted question(b) for my "Theory of Computation" course.

it's from a book named " Introduction to formal languages and automata - 6th edition by Peter Linz"

**Please show the steps of the solution, solve it briefly if possible, and provide a clear picture of the solution.

7. Show that the following languages on a, b, c are not context free: nb (w) nc (w) a (w) w: n (w) nb (w) 32no (w) ,na (w) h)L {anbm n and m re both prime (i) L ta b n is prime or m is prime (i) L fa' bm is prime and m is not prime n

Explanation / Answer

To prove L = { anbj : n>= (j-1)3} is not Context Free:

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

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