UNIVERSITY OF THE PUNJAB

Fifth Semester 2015 Roll NO. _________________

Examination: B.S. 4 Years Programme

PAPER: Theory of Automata (IT) TIME ALLOWED: 2 hrs. & 30 mins.

Course Code: IT-301 MAX. MARKS: 50

Attempt This Paper on Separate Answer Sheet provided.

SUBJECTIVE TYPE

Question #2: Answer the following short questions. (5x4 marks)

a) Give the statement of Kleene’s Theorem.

b) Give the Recursive definition of the Regular Expressions.

c) Give the definition of CNF and describe the advantage of this grammatical format.

d) Give an example of the Context Sensitive Language.

e) Give the comparison of the power of FA, DPDA, NPDA and Turing Machines.

Question #3: Answer the following questions briefly: (6x5 marks)

a) Give the Turing Machine accepting the language PALINDROME over ∑ = {p, q}.

b) Construct a PDA accepting the language PALINDROME over ∑ = {c, d}.

c) Convert the following CFG into CNF:

S ⟶ A | b BB a | c

A⟶B|a

B⟶S|b|Ʌ (Note: Ʌ represents the Null String here.)

d) Give the Regular Expression and FA for Multiple Line Comments as supported by languages like C/C++/Java.

e) Construct FA1 = (FA)* : (show the process as well)

Given FA is:

Upload by Waseem Ali link:bsprograminfo.blogspots.com