Consider the language defined over the alphabet = {0,1}: {0n 1 n 2} L = [10]...

 

Transcribed Image Text:

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] 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]