CS4330: Theory of Computation
CS4330: Theory of Computation
1. (25) Prove that for any regular languages A and B,
2. (25) Give a context-free grammer for generating the following language:
3. (25) Prove that the following language is not context-free using the pumping lemma:
DETAILED ASSIGNMENT