Question: 5. Consider L = 11 (0+1)* 1n. a. Give a Context Free Grammar that generates L. b. Give a Pushdown Automaton that recognizes L. 6.

5. Consider L = 11 (0+1)* 1n. a. Give a Context Free Grammar that generates L. b. Give a Pushdown Automaton that recognizes L. 6. Consider a Pushdown Automata with TWO STACKS. Show that this machine is more powerful than a single stack PDA. (Use the language L = {a bac" } which is not a CFL. Explain how a two stack automata can accept this language.) HINT : Give a table representation of the 2PDA - it should have 7 columns : state, input, stack 1, stack 2, new state, stack 1 operation, stack 2 operation
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
