wwwergpvontine.com wonergpvontinee Tel No.of Questions 8) oa No.of Printed Pages :2 a RON cence 5. 9) Gonsructa PDA for accepting languege C8-227 0°21) by the Nall stack. BESaeee ©) ConsiuctaPDA equivalent tothe following grammar Choice Based Credit System (CBCS) ieaeart Sqcenalinason, Z ‘Theory of Computation a3 B~as|islo 2 Time: Three Mours aa ‘est wheer 10s in A), zg swwwagpvonline.com ‘Maximum Marks: 60 3. ‘ man Nowe: i) Auemptany five questions. inteltie PED coremonthatEDMc : 4i) Allquetons cary equal marks. FF ‘Ax ({aasai) (ab) a.20) 64s 20,9) and 5 is givenby 5 1, a) Construct a Finite Automaton accepting all string over > (0,1) ji) Hoavingodd number of's ii) Having even numberof 's an cven numberof 1's 5(¢0.6.2)=(av2) 2) BelanFinte Auonatonandis various pes. 7 aucsletene 2 2. @ Construct an NEA for the regular expression 5(ae4)=(an) g rao". a Y swwwsgpvontine.com % 1) Sateandprovethepumping lms for regula st. 3 Alawrte) (eve) Fs fitpenm theft 2 7. 8) Wirt the clomie property of Regula expression. Hi G pamela I 2 b) Explain Melay and Moore machines. So Adla As ssp wove rgpvonline com 4. Explain with example Chomsky Normal Form and GNF Forms? csr #2 Pro ‘www.rgpvonline.com Write short notes on (any v0): 8) Tractable and umtactable problem. 1b) Twing machine ©) Recursive and Recursively enumerable language, rerppvesiincon