Roll No.... Total No. of Questions: 091 [Total No.

of Pages: 02

tn)^ 'cJ'*' vrrrb. <\a-.Lrcak- v

ut

Pdper ID [CS 4041

(l'lease l'ill this P:rpcr lD irr OllR Sheet)

B. Tbch. (Scrn. - 7thl8th)

r\AY.?I
Maximtrm Marks:60

THEORY(CS- 404) FORMAL LANGUAGE & ALTTOMATA

Time: 03ltours Instructionto Candidates: 1) 2) 3) Section A is Compulsory. from Section- B. Attemptany Four questions Attempt any Tivo questionsfi'om Section- C. Section- A Q|) a) b) c) d) e) What do you meanby Kleen's Star? Left derivation. Explain What do you meanby ContextSensitiveLanguage? Give the formal definition of RegularExpression. automataacceptingthe set of all strings Constructa nondeterministic over {a,b} endingin ab. What do you meanby CanonicalDerivation. only the word ^. Also write the corresponding Build a FA that accepts expression. regular Explainrewriting systems. DefineContextFreeGrarrllnar. f)efinePushdor'vnAutomata. (10x 2:20)

0 . g) . h) t j)

R-60220s8J !

PT.O.

Secfion- B

FiniteAutomataequivalent the regularExpres'siorl to Q2) Construct (a + b)*(ab+ ba)(a+ b)*

t ."' '^ -fur,ing 2DFA and Machine. QJ) Dltretintiatd'between

'"'1.i:'- r^:'r^;tl't*7:* o,,* {! 'i' i ' . !'ol '.., *t

Qa) What are LR (k) grammars.Explain with examplesand also state sorre properties. the odd palindrome. QS) Build a PDA that accepts language Classes. Q6) Explain the Closurepropertiesof Language Section- C (2 x 10:20) and Q7) Write a note on FormalLanguages grammars. Q8l ConstructDFA which acceptsstrings having odd number of a's and even number b's. of Q9) Designa Turing machineM to recognizethe language{a"bnI n>: 1}

*k +e*(

R-602

-2-