Total No. of Questions : 6] SEAT No.

8
23
P72 Oct./TE/Insem.-191 [Total No. of Pages : 2

ic-
tat
T.E. (IT)

4s
THEORY OF COMPUTATION

7:3
01 91
(2015 Course) (Semester - I)

0:3
0
91
Time : 1 Hour]
4/0 13 [Max. Marks : 30
Instructions to the candidates:
0
8/2
1) Attempt questions Q1 or Q2, Q3 or Q4, and Q5 or Q6.
.23 GP

2) Neat diagrams must be drawn wherever necessary.

E

3) Figures to the right indicate full marks.

82

8
C

23
4) Assume suitable data, if necessary.

ic-
16

tat
8.2

4s
Q1) a) Construct Mealy machine to find 2’ complement of any binary number
.24

7:3
91
& convert it into Moore machine. [8]
49

0:3
30

b) Define following:- [2]

91

i) ∈ -closure of a state
01
01
8/2

ii) NFA
GP
4/0

OR
CE
82

8
Q2) a) Construct the minimum state automation equivalent to the transition

23
.23

diagram given below. [8]

ic-
16

tat
8.2

4s
.24

7:3
91
49

0:3
30
91
01
01
8/2
GP
4/0
CE
82
.23
16
8.2

b) State what do you mean by FSM & state limitations of FSM. [2]
.24

P.T.O.
49
Q3) a) Determine the regular expression over the Σ = {a,b} for the following[6]

8
23
i) Set of all strings containing exactly 2 a’s

ic-
ii) Set of all strings containing at least 2 a’s

tat
iii) Set of all strings that do not consist of two consecutive 0’s

4s
b) Convert the given Right-linear Grammar into its equivalent Left-linear

7:3
01 91
Grammar. [4]

0:3
S → 0A|1B

0
91
4/0 13
A → 0C|1A|0
B → 1B|1A|1
0
8/2
.23 GP

C → 0|0A
OR
E
82

8
Q4) a) Define Pumping Lemma & Apply it to prove the following
C

23
{ }

ic-
2
L = 0i / i is an integer, i ≥ 1 is not regular. [6]
16

tat
8.2

4s
b) Describe in simple english the language defined by the following regular
.24

expressions:- [4]
7:3
91
(a+ b) * ⋅ aa⋅ (a+ b) **
49

0:3
i)
30

a+ b* ⋅ c + ∈
91

ii)
01
01
8/2

Q5) a) Check whether or not the following Grammar is ambiguous; if it is remove

GP

the ambiguity and write an equivalent unambiguous grammar. [6]

4/0

S→iCtS|ictSeS|a
CE
82

8
23
C→b
.23

b) Write note on: Chomsky Hierarchy. [4] ic-

16

tat
OR
8.2

4s

Q6) a) Simplify the following Grammar [6]

.24

7:3

i) S → aA|bS|∈
91
49

0:3

A → aA|bB|∈
30
91

B → aA|bc|∈
01
01

C → aC|bc
8/2
GP

ii) S → A|bb
4/0

A → B|b
CE
82

B → S|a
.23

b) Find the CNF for the given CFG S → 0S1S|1S0S|∈ [4]

16
8.2


.24
49

TE/Insem.-191 2