Chandigarh Engineering College, Landran, Mohali

Department of Information Technology

MST- II

Subject Name and Code: Formal Language & Automata Theory (BTIT501-18) 3rd Year /
5th Semester
Time: 60 min
Name: Roll No.

Max Marks: 24 Date of Exam: 23rd November 2020

Note: Section A is compulsory. Attempt any two questions from section B and one question from
section C.
Course Outcomes
CO1: Understand a formal notation for strings, languages and machines.
CO2: Design finite automata to accept a set of strings of a language.
CO3: Design context free grammars to generate strings of context free language.
CO4: Write the hierarchy of formal languages, grammars and machines.
CO5: Distinguish between computability and non-computability and Decidability and
undecidability.
Section A (8 Marks) Marks Relevance
Distribution to CO no.
Q.1. Give Formal Definition of TM. 2 CO1, CO4
Q.2. State the transition function of: (i) Multi-tape TM 1+1 CO4
(ii) Non-Deterministic TM. 2
Q.3 Give Formal Definition of PDA. 2 CO4
Q.4. What is Context Sensitive languages? CO4
Section B (8 Marks)
Q.5. Construct a PDA for the language L= {anbmcn+m | n,m >=1} 4 CO3, CO4
Q.6. State and prove Pumping Lemma for Context-Free Languages. 2+2 CO2, CO3
Q.7. Construct TM that accepts Even Palindrome over the alphabet Σ={a,b} 4 CO4

Section C (8 Marks)
Q.8. Discuss the variants of Turing Machine. 8 CO4
Q.9.(a) Define Recursive Language & Recursively Enumerable Languages? 2+2 CO5
(b) Show the acceptance of the String “0011” from the given 4 CO4
transition table.
Present State 0 1 x y b
 Q1 xRq2 - - - bRq5
Q2 0Rq2 yLq3 - yRq2 -
Q3 0Lq4 - xRq5 yLq3 -
Q4 0Lq4 - xRq1 - -
Q5 - - - yRq5 bRq6
*Q6 - - - - -