1) Describe when a relation will be equivalent?
2) prepare down the principle of Structural Induction.
3) What do you mean by Regular languages?
4) Describe how we can prove the language is not regular?
5) Create the context free grammar for pal of palindromes.
6) prepare down the 7 tuples of pushdown automata? describe it in detail.
7) Sketch the Turing Machine to find out n mod 2.
8) Describe when a language will be is recursively enumerable?
9) What is meant by PCP?
10) Describe busy beaver function in detail.