1) Create PDA and input string derivation.
2) Describe theorem for empty stack to final state and vice versa in detail.
3) Describe closure properties of regular languages.
4. Transform FA to RE and corresponding theorem.
5) Transform RE to NFA, convert to DFA and find Minimized DFA.
6) describe pumping lemma theorem for RE with suitable ex.
7) describe pumping lemma theorem for CFL with suitable ex.
8) Describe programming Techniques for TM in detail.
9) What are the closure properties of CFL and describe them.