Seat Number

ÔãÀÔã - 033

*1360*

Formal Language & Automata Theory

(Also Old Sem.- V Equivalence)
(175102 / 225102)
P. Pages : 2
Time : Three Hours Max. Marks : 80
_______________________________________________________________________________
Instructions to Candidates :
1. Do not write anything on question paper except Seat No.
2. Graph or diagram should be drawn with the black ink pen being used for writing
paper or black HB pencil.
3. Students should note, no supplement will be provided.
4. Attempt any two questions from each unit.
5. Assume suitable data if necessary.
6. Figures to the right indicate full marks.

UNIT – I

1. a) Construct the minimum state automaton equivalent to the transition diagram given 8
below.

1 0 1
0 1 1 0
0 0 0
a b c d e f g h
0 1 1 0

1 1

b) Convert the following Mealy machine to Moore machine. 8

q1

0
a/
b/
1

q0 a/1 q2
b/ 0
0 a/
1
b/

b/
1

q3

a/1

c) Explain equivalence of DFA and NFA. 8

ÔãÀÔã - 033 1 P.T.O

 ÔãÀÔã - 033
UNIT – II

2. a) Construct the finite automaton equivalent to the regular expression (a+b)* abb. 8

b) State the prove pumping lemma for regular sets. 8

c) Construct a regular expression corresponding to the transition diagram given below. 8

q1
a a
a,b
q0 b q3
a

b b
q2

UNIT - III

3. a) Remove the useless symbol from the following grammar. 8

S  aB | bX
A  BAd | bSX | a
B  aSB | bBX
X  SBD | aBx | ad

b) Convert the following grammar to CNF. 8

S  ABC
A a|b
B  Bb | bb
C  aC | CC | ba

c) Explain pumping lemma for context-free languages. 8

UNIT – IV

4. a) Write Markov algorithm to find GCD of two numbers. 8

b) Write the PMT system which can generate well-formed parentheses. 8

c) Define PDM. Explain power of PDM with example. 8

UNIT – V

5. a) Design a TM that copies strings of 1's. 8

b) Design a TM to compute square of a unary number. 8

c) Explain universal TM with example. 8

***************

ÔãÀÔã - 033 2