Total No. of Questions : 4] SEAT No.

8
23
P-5341 [Total No. of Pages : 3

ic-
tat
[6187]-426A

7s
5:5
T.E. (Computer Engineering) (Insem.)

02 91
0:4
THEORY OF COMPUTATION (Theory)

0
31
5/0 13
(2019 Pattern) (Semester - I) (310242)
0
9/2
Time : 1 Hour] [Max. Marks : 30
.23 GP

Instructions to the candidates :

E
80

1) Answer the question of 1 or 2, 3 or 4.

8
C

23
2) Neat diagrams must be drawn whenever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
4) Assume suitable data, if necessary.
8.2

7s
.24

5:5
91
Q1) a) Draw FA for the following language over {0. 1} [8]
49

0:4
30

i) Number of 1’s is multiple of 3.

31
01
02

ii) Number of 1’s is not multiple of 3

9/2
GP

b) Covert following NFA into equivalent DFA and perform DFA minimization
5/0

[7]
CE
80

8
Q/ 0 1

23
.23

P
ic-
{P, Q} {P}
16

tat
Q {R} {R}
8.2

7s
.24

R {S} --
5:5
91
49

0:4

S* {S} {S}
30
31

OR
01
02

Q2) a) Construct DFA for checking “whether a string over alphabet {a, b} contains
9/2
GP

a substring aba”. [5]

5/0

b) i) Differentiate between Moore machine and Mealy machine.

CE
80

ii) Construct Moore machine equivalent to the following Mealy machine.

(Show it in transition Diagram)
.23

M = (Q, , , , q0) where Q = {q0, p0, p1), = {0, 1), = {y. n} and
16

 is shown as given below.

8.2

P.T.O.
.24
49
 Input / Output

8
23
States 0 1

ic-
q0 p0/n p1/n

tat
7s
P0 p0/y p1/n

5:5
02 91
P1 p0/n p1/y

0:4
0
[5]

31
c) 5/0 13
Convert the following DFA to its Minimized form (Minimization of DFA).
[5]
0
9/2
.23 GP
E
80

8
C

23
ic-
16

tat
8.2

7s
.24

5:5
91
49

0:4
Q3) a) Prove that LHS RE is equivalent to RHS RE
30
31

(1+00*1)+(1+00*1)(0+10*1)*(0+10*1) =0*1(0+10*1)* [5]

01
02

b) Find a regular expression corresponding to each of the following subsets

9/2

of {0,1}* [6]
GP

i) The language of all strings containing exactly two zeros

5/0
CE

ii) The language of all strings containing at least two zeros

80

8
23
iii) The language of all strings that do not end with 01.
.23

ic-
c) Write a note on Myhill Nerode theorem. [4]
16

tat
OR
8.2

7s

Q4) a) Construct Regular expression for following DFA using Ardens theorem.[7]
.24

5:5
91
49

0:4
30
31
01
02
9/2
GP
5/0
CE
80
.23
16
8.2
.24

[6187]-426A 2
49
 b) i) Write regular expression for a set of strings of 0s and 1s with even

8
23
number of 0s.

ic-
ii) Write regular expression for a set of strings of 0s and 1s containing

tat
odd number of 1s.

7s
[4]

5:5
02 91
c) Choose any one option given below and give the justification “The regular

0:4
expression 0*(10*)* denotes the same set as” [4]

0
31
i) 5/0 13
(1*0)*1*
0
9/2
ii) 0+(0+10)*
.23 GP

iii) (0+1)* 10(0+1)*

E
80

8
iv) none of these
C

23
ic-
16

tat
8.2



7s
.24

5:5
91
49

0:4
30
31
01
02
9/2
GP
5/0
CE
80

8
23
.23

ic-
16

tat
8.2

7s
.24

5:5
91
49

0:4
30
31
01
02
9/2
GP
5/0
CE
80
.23
16
8.2
.24

[6187]-426A 3
49