The Gateway to Computer Science Excellence

0 votes

Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$

- $S\rightarrow TT\mid U$
- $T\rightarrow 0T\mid T0\mid \#$
- $U\rightarrow 0U00\mid\#$

- Describe $L(G)$ in English.
- Prove that $L(G)$ is not regular$.$

52,218 questions

59,895 answers

201,086 comments

118,134 users