B.Tech Data Technology Theory Of Computation 2017 Inquiry Newspaper Deemed Academy

1. Draw Chomsky Hierarchy amongst grammar, linguistic communication in addition to automata used.
2. Give description of automata theory.
3. Prove past times Mathematical induction ane + iii + v + seven + ... + 2n-1 = n2
4. Determine string acceptability of 01100 using transition component for below automata. Draw Transition table.
5. Define alphabet, string, language, grammar. Define Pigeon hole principle.

Section B
(Long Answer Type) ii questions of twenty marks each (any 1)20
1. Prove past times Mathematical induction 12+22+32+42+………+n2 = n(n+1)(2n+1)/6
2. Construct a DFA equivalent to the NFA given below: