Requesting assistance with Theory of Computing
1. Convert the following grammar to Chomsky normal form;
S-->aACa, A -->B|a, B--> cC|e
2. Let L be a language with equal number of a's and b's. Is L regular or context free? Define the grammer which generates L.
3. Construct a PDA which accepts L from Question 2.