[This question paper contains 8 printed pages.] Sr. No. of Question Paper : Unique Paper Code Name of the Paper Name of the Course Semester Duration : 3 Hours Your Roll No... 1042 Gc 32341502 : Theory of Computation B.Sc. (Hons.) Computer Science V (Admissions 2019-2021) Maximum Marks : 75 Instructions for Candidates 1. Write your Roll No. on the top immediately on receipt of this question paper. 2. Question No. 1 (Section A) is compulsory. 3. Attempt any four Questions from Nos. 2 to 7 (Section B). 4. Parts of a question must be answered together. 5. Consider 2 = {a,b} for all the questions unless specified otherwise. SECTION A 1. (a) Let s = {aa, bb} and T = {aa, bb, bbaa}. Show that S*=T*. Does the string a belong to the language S*? Justify. (3) BO.1042 a (& Design a right shifting hiring machine. Assume ‘the initial configuration to be >LiwL) and desired ‘output configuration to be eUUwLI. @) SECTION B 2. (@) Consider the following language of all the words defined over having 5 {a,b} comprising only b’s including empty string 2. Build a finite automaton FA that accepts the given language and find its Kleene closure i.e. (FA) *. © (b) Convert the following non-deterministic finite automaton to deterministic finite automaton: (4) 1042 5 (a) For the following pairs of FAs, build a finite automaton that accepts the intersection of languages defined by FA1 and FA2. Also, build a finite automaton that accepts the complement of, the language defined by FAI. (6) (b) Show that the set of regular languages are closed under union and kleene closure using non- deterministic finite automata. (4) 4. (a) Using the bypass theorem, convert the following transition graph into a regular expression: (6) P.T.O.1042 6 (b) Use pumping lemma to prove that the language {a"b’c" where n=1,2,3,4,5....} is non-context free language. : 4) 5. {a) For the Push Down Automata shown below : {i) Describe the language accepted by it. Gi) Is the given PDA deterministic or non- deterministic? 4) 1042 a 6. 7 (b) Construct a PDA for the language a*b%a™ where © m, n>=1 and q=m+n. (a) Consider the following context free grammar: S > AbB A> adj B > aB | bB) A Construct an equivalent CFG by eliminating all 2 productions and convert the resultant grammar into chomsky normal form (CNF). @ (b) Write the-CFG for the language containing all words which are palindromes excluding the null string:, Create a parse tree for the word abaaba. ® (c) Show that the following CFG is ambiguous: (2) S > XaXaX X > aX] bX [2 (a) Assume © = (0,1). Design a standard turing machine M that computes one’s complement of the binary number on the input tape. Assume the P.T.O,8 1042 initial configuration to be >Uw (if the input is eUw, the output should be >Liw’, where w’ is the one’s complement of w). Show the trace of above turing machine M on the string >LJ0110. (5) (b) Prove that if a language is recursive, it is also recursively enumerable. (2) (c) Consider the Turing Machine M = (K, 2, 5, s, {h}), where K = {s,q,h}, 2 = {U, ©, a} and 6 is given in the following table : Give the representation of Universal Turing machine for M. : (3) (1500)