—eceore) | cen x] a-14 | -res/ 02-0602 uinsdon summers QP CDE | D257 ‘Time: 2 hour 30 minutes Subject: TCS ‘Max. Marks: 80 Choose the correct option for following questions. All the Questions are compulsory and earry equal marks If La and Lz are context free language and R is a regular set, then) which one of the languages below is not necessarily a context free | | language? | | Option A: [LL Option B: | L, UL, Option: 1s te Option: | LAR 2. ‘A Context Free Grammer G=(V,T,P, $)is said to be in : ifevery productions is of the form Aaa where a € Tis a Termin; and a isa string of zero or more variables. Option A: | Unit production. Option B: | Chomsky Normal form. | | Option C: | Null production. Option D: 1 | ; = =| 3. | Consider the following statements 1: Each Turing Acceptable language is necd not tobe Turing Decidable. | IL: Every Turing Decidable is Turing acceptable. | : — i Option A: | Only Tis tue. | Option B: | Only Tis true, Option C: | Both are false. OptionD: | Both are trie. Option B: | Only Context sensitive grammer | | Option C: | Only regular grammar Option D: | Any grammar 5. | Recursively enumerable languages are not closed under 20 (CESECEBF836D3DAACTAOBDI4DC8B95S9Option A: | Concatenation Option B: | Complementation Option C: | Homomorphism | Option D: | Union 6 IEP, Q, R be the three regular expressions then the equation R= Q+ RP has a unique solution given by : OptionA: | R= RP { Option B: | R= QP* | Option: | R=Q*P t | | Every Context free language can not be recognized by a but it ean be | recognized by. NPDA, DPDA. DPDA,NPDA.. NPDA, NPDA. DPDA,DPDA. | _ q | Ta language is denoted by a regular expression 8 (L=(x)*@lyx), then which of the following is not a legal string within L? Option A: | yx : — Option B: | aye = | Option: |x OptionD: | xyxyx 9. | Algorithmically , Which of the following conversion is not possible ? “Option A: | Regular grammar to context-free grammar Option B: | Non-deterministic PDA to deterministic PDA Option C; "| Non-deterministic TM to deterministic TM i | is the Type 1 grammer according to Chomsky Hierarchy. 2| Page 8] (CESFC8BF836D3DA4C7AOBDI4DC8B9559Option A: Unrestricted Grammer. Option B: Regular Grammer. Option C: Context free Grammer. Option D: Context sensitive Grammer. Qu Solve any TWO S marks each Compare and Contrast Moore and Mealy Machine. | Find the GNF equivalent to CFG: SAB A aA |BB|b 7. ab ii ‘State and explain pumping lemma theorém for regular languages. Solve any One 10 marks each | Give the Moore and Mealy machine for the following processes “For input from (0+ 1 )* ,if inputs ends in 101 , output x ; if input ends in 110 , output y ; otherwise: output” Let G be the grammer: S—+aB|bA, A-alaS|bAA B—b|bS|aBB Find : i) Left most derivation Right oe derivation | | Ile peor isan 2, forthe given string 00110101 a OS | Solve any TWO ‘S marks each Explain Non-deterministic PDA. ii 15 Obtain DFA to accept strings of 08 and 1's with even no. of 08 and even no. of 3| Page 24. CESFC8BFS36D3DA4C7AOBDI4DCEB9SS9Explain halting problem of Turing Machine. B Solve any One Tomarkseach | ' | Benen Mackie oars kegs ghey serena : CConsrut the PDA accepting following language : L=aboc|m,n>=1. a | | Solve any TWO ‘S marks each Explain Chomsky Hierarchy. Describe Finite State Machine, | iti | Construct left Linear and right Hineat grammer forthe regular expression : ((O1+10)* 11) * 00 Solve any One 1Omarkseach | Design a TM whiclirecognizes words of the form aebcs| n>= 1. Convertthe following RE to €-NFA and then convert it to DFA R=((OF1)*10+(00)*(11) *)* 4|Page 33 (CESECEBFS36D3DA4C7AOBDI4DC8B9559