Let G = (V, , R, S) be the following grammar. V = {S, T, U};

Question:

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

S → T T | U

T → 0T | T 0 | #

U → 0U00 | #

a. Describe L(G) in English.

b. Prove that L(G) is not regular.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: