Seat Number

¹ãÆñÀ¥ãã - 033

*3801*

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. Figure to the right indicate full marks.

UNIT – I

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

below.
b a b
b q3 a
q0 q4
q5
b
a a a b
a a
b
q2 q7 a q6
q1 b
b

b) Consider the Moore machine describe by following transition table. Construct the 8
corresponding mealy machine.

Present State Next State Output

a=0 a=1
 q1 q1 q2 0
q2 q1 q3 0
q3 q1 q3 1

c) Explain equivalence of DFA and NDFA. 8

UNIT – II

2. a) Construct DFA accepting language represented by, (ab / ba) *  aa  (ab / ba) * . 8

¹ãÆñÀ¥ãã - 033 1 P.T.O

 ¹ãÆñÀ¥ãã - 033

 
b) Show that L  an bn1 | n  0 is Non-Regular. 8

c) Explain pumping lemma for regular sets. 8

UNIT – III

3. a) Consider grammar G given as, 8

S  a | Xb | aYa
X  Y |
Y b| X
eliminate E-Production.

b) Explain Chomsky hierarchy. 8

c) Convert the following grammar to CNF 8

S  ABA
A  aA |
B  bB |

UNIT – IV

4. a) Construct PDA which can accept the language 8

L = {X, aXa, bXb, aaXaa, abXba, baXab, ----}.

b) Construct PDA that accepts the language generated by the CFG. 8

S  s  s| ss| 4

c) Design a Markov algorithm to find out the 1's complement of any binary number. 8

UNIT - V

5. a) Design Turing Machine for checking Well-Formedness of parentheses. 8

b) Design Turing machine to obtain the reversed string from the given input string over 8
  a, b .

c) Explain halting problem of Turing machine. 8

*********

¹ãÆñÀ¥ãã - 033 2