MadeEasy Subject Test: Theory of Computation - Context Free Language

Question

Answer 1

L1 is n(b)=3n(a) {no restriction on order in which a's and b's appear.}

L2 is having above condition too, but have an extra restriction on the order.

so, L2 is definitely a subset (a proper subset) of L1.

Comments

IN L2 nothing is said about b.

---

In L2, every a is followed by 3 b's.