567 B.E, Vith Semester (Compt. Sclence Engg.) Examination THEORY OF COMPUTATION Paper-CSE-310-C Time allowed : 3 hours Maximum Marks : 100 Note : Attempt any fire questions. 1. (@)_ What do you mean by finite state machine? Explain the limitations and capabilities of it 8 (©) Define NFA with E moves. Write algorithm to convert NFA with E moves to NFA without E moves. Ilustrate with an example. 2 2. What do you mean by regular expression? Let r be a regular expression then prove that there exists an NBA with E moves that accepts L (1)- 20 4, State and explain the algorithm which will reduce a DPA to anew DFA with minimum number of states. Apply this algorithm to the following DFA : 20 §67-600-P-2-Q-8 (04) PTO.(2) 567 “Write the procedure to remove the useless symbols from # CFG, Remove the useless symbols from the grammar SP AB/a Asa 20 (©) Construct aPDA equivalent the following grannonar S+aAA, Asasibs/a 10 (>) Provethat the languages accepted by PDA by final state are exactly the same as languages accepted by PDA by empty stack, 10 5. Briefly explain the basic Turing machiae madel. Design a TM to accept the language Lefoin2 I}. 20 7. Explainthe following: () Universal’TM and an undecidable problem 10 Gi) Context sensitive Languages. 10 8 Write short noteson: (iy Chomsky hierarchy of grammars 10 (i) Unrestricted grammar, 10 567-600