CHAROTAR UNIVERSITY OF SCIENCE & TECHNOLOGY Sixth Semester of B. Tech. Examination (CE) Dee 2013, C306 Theory of Computation (TOC) Date: 05.12.2013, Thursday Time: 1:30 p.m. To 04:30 p.m. Maximum Marks: 70 n paper comprises of two sections, 2. Section and IT must be attempted in separate answer sheets. 3. Make suitable assumptions and draw neat figures wherever required. 4, Rough work is to be done in the last page of main supplementary, please don’t write anything on the question paper. 5. Indicate clearly, the option(s) you attempt along with its respective question no. 6. Figures to the right indicate marks. SECTION-I Q-1 Answer the following questions. 1. Define DFA and justify the statement: NFA is more powerful than 2 DFA . Any sentence produced by grammar that has a unique parse tree is 2 said to be an ambiguous grammar. Justify. v 3. The RE: 0* (10)* denotes the same set as (1*0)*1* 2 4, Define a CFG for the L= { ab" | n>m} 3 5. Show that a given CRG is ambiguous: S> ABA A> aA|* B> DB 2 Q2 i [A] Construct and demonstrate NFA to DFA conversion forthe RE: (a [byt abta 4 oR [A] _ Prove that for any NFA M=(Q, 5, qo, A, 6) accepting a language L, subset 4 of 5%, there is a FA MA(= (Qi, Z5 uy At, 61) that also accepts 4 [B] Generate the RE for the given CFG below: Give automata for the Grammar 4 (Language) and write what is the L accepted by the automata? S> aS |bS |a[b [C] Prove that for any string x belongs to 5 and any n>= 0 (x'")""=x. 4 oR [C] Prove that for any sets A, B and Cif AB=( and Cisa subset of Bthen AC | 4 ae Q3 [A] Construct NFA for: 10+(0+11)0*1 4 OR [A] Design the CFGs in the 4-tuple form (V, T, P, S) for the given languages 4 over the alphabet (a, b). 1. All strings having at least two a’s 2, All possible strings not containing triple b’s [B] Show thatif Li and L2 are context free languages then L1 union L2 and Ll 4 L2 and L1* are also context free languages. [C] Find a regular expression corresponding to each of the following 4 subsets of {0, 1}*. 1. The language of all strings not containing the substring 000. 2. The language of all strings containing both 101 and 010 as substrings. Page | of 2{c] Qs [A] [B] [c] O5 (a) [B) Q6 [A] [B] Bl [c] (c] OR Prove using mathematical induction that for every nonnegative integer n, L4 Sistemas SECTIONAL 1. Define: Acceptance by Deterministic PDA. 2. Define: Recursive language and Recursive Enumerable languages. 3. Let (VTP §) be a context free grammar, define PDA ‘M’ such that LO)= LG). Construct a top-down PDA for { x belongs to {a,b)*|x is a Palindrome} Construct a turing machine for: (alb)*aba Write a short note on the followin; 1. Derivation tree and ambiguity 2. Pumping lemma for CFG OR Construct a turing machine for odd length palindrom. Convert the following CKG and into CNR: $9 aSa|bSb| A A> abb| bBa B>aB [bB|A Discuss: P problem, NP problem, Deeision Problem and Applications of Computational Theory. Prove using pumping lemma that language L={0't! /i>=0} is not regular. Define: Strings Distinguishable with Respect to L. OR Show that if LI and L2 are context free languages then L1 waion L2 and L1L2 and L1* are also context free languages. Draw a Push Down Automata eccepting the langauge of even length Palindromes over {a,b}. OR Define Turing Machine, And also throw light on how it is most powerful machine as compared to DFA, NFA and PDA. Page 2 of 2 6 aa 4 4 4 4 4 4