Code No.

9121
FACULTY OF INFORMATICS
B.E. 3/4 (I.T.) I - Semester (Main) Examination, December/January 2014-15

Subject: Theory of Automata

Time : 3 Hours Max. Marks: 75

Note: Answer all questions of Part - A and answer any five questions from Part-B.
PART – A (25 Marks)

1 Give the formal definition of PDA. (2)

2 Draw the NFA for regular expression a*+b*. (3)
3 List the decision properties of context free language. (2)
4 Define sentenial forms in content free grammar. (2)
5 What is the difference between NFA and -NFA? (3)
6 What is NP-complete problem? (2)
7 What is a counter machine? (2)
8 Define Griebach Normal form. (3)
9 Identify useless symbols from grammar. (3)
S  AB
Aa
BC/b
CD
DE
Ea
10 List the applications of Regular expressions. (3)

PART – B (50 Marks)

11 (a) Design a DFA which accepts strings containing even no. of zero’s and odd no. of 1s. (4)
(b) Convert given FA to regular expression using Arden’s theorem. (6)

..2
 Code No. 9121
-2-

12 Minimize the given DFA. (10)

States 
0 1
A B F
B G C
*C A C
D C G
E H F
F C G
G G E
H G C

13 Convert the given PDA. (10)

P=({p, q}, {0, 1}, {X, Zo}, , q, zo)
to context free grammar if “” is given by
(q, 1, zo) = (q, Xzo)
(q, 1, X) = (q, XX)
(q, 0, X) = (p, X)
(q, , X) = (q, )
(p, 1, X) = (p, )
(q, 0, zo) = (q, zo)

14 Explain about programming techniques of Turing machines with suitable examples. (10)

15 (a) Explain about post correspondence problem. (5)

(b) Explain about universal language. (5)

16 Explain about closure properties of Regular languages with suitable examples. (10)

17 (a) What is ambiguous grammar? Prove that the following grammar is ambiguous: (6)
E  E + E |E * E | (E) | I
I  id
(b) Write short notes on multi-track turing machines. (4)

*****