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

2. CFG, CFL, and PDA Total (60 points) Consider the grammar Go A1BIOA a. (10 pts) Is the Grammar in CNF? If not convert it to CNF? b. (10 pts) Is the string 0511001 E L(Go)? c. (20 pts) Is the string s = 11 100 L(Go)? If yes find YCK parse tree. Are there substrings of s that belong the the language L(Go). c. (20 pts) Create a pushdown automaton P such that L(P)L(Go). Use the graphical format, i.e., draw the state transition diagram