__K-J.Somalya Institute of Engineering and Information Technology, e (Autonomous College Affiliated to University of Mumbai) subject Code: CECSOI Subject Name: Theory of Computer Science ®SO-\\-2022- mn, Mumbai-22 Nove 202; . (B.Tech) Program: Computer Engineering Examination: 7Y Course Code: CECSO1 and Course 5 Hours ime: Theory of Computer Scieace Max. Marks: 60 ai I/questions are compulsory. WW neat diagrams wherever applicable. 4)S={strings ending with 0 always} oe representing odd binary numbers) e Suitable data, if necess : Max. | co | BT j Marks level [Sve any six questions out of eight 12 Define the followin, it tine ig terms with example 2] | col Jeu, |b) DFA | Determine the number of states in the minimum sized DFA that ac in cepts the | 2 102 language defined by the regular expression (O+1)*(O+1)(0#1)*? : : “ Justify this with short explanation al, Define the following terms Alphabet 22] COLA b)String Way Context free gre.umar is pisced in Type 2 granmar? Justify with : i wi Come re tify wit 2 [cos] an [dentify tive false statement from given set of statements Ta [oot a 1- Every NFA can b2 converted to an equivalent PDA a 82. Every nonileterministic PDA can be converte to an equivalsat deterministic PDA Write in short which lanzuage is accepted by Turing machine [2 [eos U List down the limitations of Turing Mach'ne [ 2 least u i) | What is unclecidabitity? __ V3 cos | U 9 | £2! any four questions out of ix. Te) Tt | ane Construct DFA for language defit.ed by Z=(0,1) where 4) }odt! an Poge 1 of 2‘Subject Code: CECSO1 K. J. Somaiya Institute of Engineering and Information Technology, Sion, Mumbai-22 (Autonomous College Affiliated to University of Mumbai) ‘Subject Name: Theory of Computer Science Date: BO 11 -2022— ii) | Give the regular expression for the following languages — 4 |co] al 4)The set of strings over the alphabet {a,b} starting with b and ending with | ‘odd number of a’s or even number of b’s i b) The set {10,1010} | iii) | Write a short note on Greibach Normal Form 4 | 603 ul iv) | Construct a PDA that accepts all palindrome strings 4 | C04] As [a.b} v) | Construct Turing machine for 1’s complement of binary number 4 | cos] as vi) | Explain about post correspondence problem 4 C06 | U Q3 | Solve any two questions out of three. 16 i) | Design a Finite State Machine to accept following language over the 8 | cor] ar alphabet {0,1} L(R)=(wlw starts with 0 and has odd length or starts with 1 & has even length} ‘What are different types of PDA. Design a PDA that accepts {ab'}n>=0} | 8 | CO4| AP ‘Construct TM for L={all string’s with equal number of a's & b's} s | cos| a Solve any two questions out of three. 16 i) _ | With respect to properties of regular language explain what is pumping 8 coz} U | Jemma and closure properties of regular language? ii) | Write an equivalent left-linear grammar for the right linear grammar 8 cos | AP S>0A)IB ADOCHIAIO B>IBIIAII COA iii) | Let HALT;_={ where M is a TM and M halts on input W} prove s | c06| 4? that HALT; is undecidable ie Seer eee ernere ees Page 2 of 2