B TECH

MODEL PAPER-2
THEORY OF AUTOMATA AND FORMAL LANGUAGE (BCS-402)
----------------------------------------------------------------------------------------------------------------------------------
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION-A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Derive the CFG for (a+b)* 2 1
b. Give the formal definition of Moore machine. 2 1
c. Explain Chomsky Hierarchy. 2 2
d. What is regular Expression? Write various applications of regular expression. 2 2
e. Explain pumping lemma for context free language. 2 3
f. Write down the Closure properties of CFL. 2 4
g. Draw the graphical representation for PDA. 2 5

SECTION-B
2. Attempt any three of the following: 10 x 3 = 30
Q no. Question Marks CO
a. i) Design a FA which accepts set of strings containing exactly four 1’s in every 7 1
string over alphabet ∑= {0, 1}

b. ii) Define
Write short Finite Automata (FA).
notes on: 7 2
i) Church’s Thesis
ii) Recursive and Recursive Enumerable Language
c. i) Reduce the following
grammar to CNF, S→abSb | a | aAb, A→bS | aAAb . 7 3
ii) Explain Chomasky classification of grammar.
d. Design a PDA for the language L= {WWT | W= (a+b)* } 7 4
e. Construct a turing machine that enumerates {xnynzn | n≥1}. 7 5

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
a. Construct a DFA equivalent to the NFA 7 1

b. Construct a minimum state automaton equivalent to the DFA given in the picture. 7 1
4. Attempt any one part of the following: 10 x 1 = 10

Q no. Question Marks CO

i i
a. Show that L= { 0 1 | i≥1}is not a regular. 7 2
b. State pumping lemma for regular language. Prove that the language L= {a p | p is 7 2
prime} is not regular.

5. Attempt any one part of the following: 10 x 1 = 10

Q no. Question Marks CO

a Describe about the derivation tree and draw the derivation tree for the 7 3
production rules given as follows –
E=E+E
E=E*E
E=a|b|c
b. A context free grammar G is given by the following productions: 7 3
E→E+E|E-E|E∗E|E^E|N N→0|1|2|3|4|5|6|7|8|9
Determine whether the grammar G is ambiguous or not.If ambiguous then construct an
unambiguous grammar equivalent to G.

6. Attempt any one part of the following: 10 x 1 = 10

Q no. Question Marks CO
a. Give a deterministic PDA for the language L= { ancb2n: n≥1} over the alphabet 7 4
∑={a,b,c}. Specify the acceptance state.
b. Design a two stack PDA for the language L={a n bncn | n>=1} 7 4

7. Attempt any one part of the following: 10 x 1 = 10

Q no. Question Marks CO
a. Write short notes on: 7 5
(i) Variants of Turing Machine
(ii) Post Correspondence problem
(iii) Universal Turing Machine
b. State and prove that post correspondence problem (PCP) is decidable. 7 5