Total No. of Questions : 4] SEAT No.

8
23
P8577 [Total No. of Pages : 2

ic-
Oct-22/TE/Insem-557

tat
T.E. (Information Technology)

2s
THEORY OF COMPUTATION

4:2
02 91
(2019 Pattern) (Semester - I) (314441)

0:3
0
21
Time : 1 Hour] 3/1 13 [Max. Marks : 30
Instructions to the candidates :
0
0/2
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4.

2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.
E
80

8
4) Assume suitable data, if necessary.
C

23
ic-
16

tat
Q1) a) Design a DFA which accepts a binary number divisible by 4. [5]
8.2

2s
b) Design a Mealy machine to increment binary number by 1. Write down
.24

4:2
transition table. [4]
91
49

0:3
c) Convert the following NFA with ε-moves to DFA. [6]
30

δ
21

State/input
01

ε
02

a b c
0/2

→p {q} {p} φ φ
GP
3/1

q {r} φ {q} φ
CE

φ φ φ
80

rx {r}

8
23
.23

OR
ic-
16

Q2) a) Define the following terms with proper examples. [6]

tat
8.2

2s

i) Alphabets
.24

4:2

ii) String
91
49

0:3

iii) Natural language

30

b) Show whether the following automata m1 & m2 are equivalent or not.[5]

21
01
02
0/2
GP
3/1
CE
80
.23
16
8.2

m1 m2
.24

P.T.O.
49
 c) Construct a DFA over the alphabet {a, b} for accepting the strings ending

8
23
with “ab”. [4]

ic-
tat
2s
Q3) a) Find the regular expression for the set of strings recognized by the given

4:2
FA using Arden’s theorem. [5]

02 91
0:3
0
21
3/1 13
0
0/2
.23 GP
E
80

8
C

23
ic-
16

tat
8.2

2s
b) Determine the regular expression over the alphabet {0, 1} for the
.24

4:2
following : [6]
91
49

0:3
i) All the string containing exactly two 0’s
30
21

ii) All the string that do not end with 01

01

iii) All the string containing 1 as a third character from end.

02
0/2

c) Explain the following terms : [4]

GP
3/1

i) Kleene closure
CE
80

ii) Positive closure

8
23
OR
.23

Q4) a) Explain any three closure properties of Regular language. ic-

[6]
16

tat
8.2

b) What is a Regular expression? Explain in brief the applications of regular

2s

expressions. [5]
.24

4:2
91

c) Construct a NFA for the following RE using direct method [4]

49

0:3
30

RE = (ab + ba)*aa
21
01
02
0/2
GP


3/1
CE
80
.23
16
8.2
.24

Oct-22/TE/Insem-557 2
49