Chapter 13, Problem 1SE

To determine

(a)

To find:

Phrase-structure grammar that generates language $0^{2n}{1}^{3n}$. Where n is non negative integer.

To determine

(b)

To find:

Phrase-structure grammar that generates language twice as many $0\text{'}sand1\text{'}s$.

To determine

(c)

To find:

Phrase-structure grammar that generates language ${\omega }^2$, where $\omega$ is a bit string.