Question: Consider the language defined over the alphabet = {0,1}: {0n 1 n 2} L = [10] i. Show that L is context-free by specifying
Consider the language defined over the alphabet = {0,1}: {0n 1 n 2} L = [10] i. Show that L is context-free by specifying a CFG G for L. [2] ii. Convert the CFG G to a pushdown automaton PN that accepts L by empty stack. iii. Give a pushdown automaton PF that accepts L by final state. [4]
Step by Step Solution
There are 3 Steps involved in it
i To show that L is contextfree we need to specify a contextfree grammar CFG G for L Lets define the CFG G as follows Start symbol S Terminal symbols ... View full answer
Get step-by-step solutions from verified subject matter experts
