KOLHAPUR INSTITUTE OF TECHNOLOGY'S, “COLLEGE OF ENGINEERING (AUTONOMOUS), KOLHAPUR (QEFILTATED TO SHIVAdT UNIVERSITY, KOLHAPUR) S.Y.B.Tech. (Computer Science & Engineering) (Semester- IV) END SEMESTER EXAMINATION, DEC- 2024 Course Code: UCSEO401 Course Name: Automata Theory Day and Date: Thursday, 19-Dec-24 PRN: 02:00 PM To 05:00 PM. Max Marks: 100 24000802 2) All questions are compulsory. ii) Figure to the righe indicate full marks iti) Assume suitable data wherever necessary, QL Attempt any Two A i Construct CFG for the language Odd length palindrome & Even Length Palinerome string set S={ xx?} ¥=(0,1}" ii, Draw DFA with transition graph for string accept 00 as a Substring over Y, ={0,1}* B AnNFA with states 1-5 & input alphabet {a, b} has the following transition table [ Swte@ | 84a) sab | 1 {1,2} Secs 2 a4 | By | pie ey cane 4 8 = Sealers ey Sy i. Draw a transition diegram ii, Calculate 8* (1, ab) iii, Calculate 8* (1, abaab) G={V,T,P,S}, where production rules P is given as, 8 Th Ti0T| 1 Tp 1T,|0 Give Lefimost & rightmost derivation of the string: 000110? Check Whether the given grammar is ambiguous? that you have received question paper with correct course, code, branch ec, CO's co2 | col con Pave tats AAttempt any two B- Describe nondetermistic finite automata with * transition with its ‘tended transition functioné& recursive definition for NFA- * C Write a Regular expression for a's iii, ‘The Language of Strings in (0, 1)* Containing 00 iv. The language of all strings containing both LI and 010 as substrings over {0, 1}* Q3 Attempt any two A Design a Turing Machine to Compute a function Reverse of string DFA from the given NFA by applying the steps for The strings over fa, b}* with an even number of a's? fi, The Language of Strings in {a, b}* with an Odd Number of Fding with 1 and Not | my | for both odd length and even length over a 5: = {a,b} * B Construct PDA which accept Even Palindrome {wwe w b}*} Where, W first half of string and WR Reverse of second half Move Number State Construct the CFG (Context Free Gr: State Transition Table (STT) above % % w % 4 a 4 4% n % a Tpit A Neexaceay 5 Mave(sy (4,20), (a1, 20) (4.20), (q1.b25) (Go, 2), (qu. {a0 4x) (q), bx) (aa) (a) GiB), G2, A) Gina. @a,A) faa, A) (a) (93, Zp) fammar) from the PDA given in ater 3 C02 2 coi 2 col | | > co4 3 co3 2 C04Q4 Attempt any tvo A. Construct a Top Down Parser for the grammar given below and show the working of Parser for the string {LOL I(" S88 Si SHC} SOS: Sian B Draw a Turing Machine to copy Strings function over aS= (a, b} * C Design a Turing Machine to delete a symbol form the given input over $= (0,1) * QS Attempt any three ort note on Top-Down Parsing & Bottom-Up Parsing mple? with exa B Describe Turing Machine & Acceptance by a Turing Machine © Show that a language a”b"c", wheren > 0 is not a Context Free Language (CAL) using Pumping Lemma D_ Write a note on Multi-tapo(n-tape) Turing Machine? \ Q4 Attempt any three | | ‘4 Design a Turing Machine for Reminder function (N Mod 2), where ‘Nis Unary Number. I ra Write a note on intersection é& complement of two Context Free Language (CFL) is not a Context Pree Language (CFL) ‘Draw a Turing Machine (TM) which accepts a language {a b ai 05 i Av(%)} where n(x) is the number of a’s in string x and ne(x) is the number of b's in string x SERIOUS ITC OE ROU IS HR a 16 18 18 COR cos cos