Data Structures/Automata/Graph Theory Question:

Here are some notes that might help via Google Drive: https://goo.gl/TdLrQe https://goo.gl/CzXuzX https://goo.gl/qnbeh2

Problem 4 Consider the grammar Go a. (10 points) Create a pushdown automaton P such that L(P) L(Go). Use the graphical format, i.e., draw the state transition diagram. b. (15 points) Using the CYK algorithm determine whether the string 0110 E L(Go If yes, show all parse trees (if more than one). Are there substrings of w that be- long the the language L(Go). Is is this grammar ambiguous? Problem 4 Consider the grammar Go a. (10 points) Create a pushdown automaton P such that L(P) L(Go). Use the graphical format, i.e., draw the state transition diagram. b. (15 points) Using the CYK algorithm determine whether the string 0110 E L(Go If yes, show all parse trees (if more than one). Are there substrings of w that be- long the the language L(Go). Is is this grammar ambiguous