Seat Number

‚ãʹã - 035

*4312*

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. Figure to right indicate full marks.
6. Assume suitable data if necessary.

UNIT – I

1. a) Design Moore machine and Mealy machine for finding 2's complement of a binary 8
number.

b) Explain Equivalence of NFA & DFA with example. 8

c) Construct FSM which can accept string over alphabet 8

 = C,H,A,R,I,O,T contain 'CAT' as substring.

UNIT – II

2. a) Show that L = ww / w  ( a,b ) * is not regular. 8

b) Explain closure properties of regular set. 8

c) Construct a DFA with reduced states equivalent to regular expression. 8

0 + ( 0 + 11) 0
*

UNIT – III

3. a) Check whether or not the following grammar is ambiguous; if it is ambiguous, remove 8

the ambiguity & write an equivalent unambiguous grammar.
S → i CtS | i CtSeS | a
C→b

‚ãʹã - 035 1 P.T.O

 ‚ãʹã - 035
b) Consider the following CFG, G = {(S,A), (a,b), p, s} where P consist of 8
S → aAS | a
A → SbA | SS | ba
derive string 'aabbaa' using leftmost and right most derivation and draw derivation
tree for the same.

c) Write a short note on.

i) Chomsky hierarchy. 4

ii) Normal forms. 4

UNIT – IV

4. a) Construct a PDA equivalent to the CFG. 8

S → OBB, B → OS | iS | O s is starting symbol test for 010000.

b) Construct a PDA accept all palindrome string over  = {a,b} 8

c) Let  = {a,b,c} be the alphabet &  = {,} be auxiliary alphabet. 8

Write the Markov algorithm for duplicating the string in  * and simulate for 'abc'.

UNIT – V

5. a) Design Turing machine to find 2's complement of given binary number & simulate for 8
the string 01010.

b) Write short note on.

i) Universal Turing machine. 4

ii) Halting problem. 4

c) Design Turing machine that recognizes words of the form 0n 1n for n  0 and 8
simulate for the string 0011.

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

‚ãʹã - 035 2