Professional Documents
Culture Documents
8
23
P8556 [Total No. of Pages : 2
ic-
[Oct 22/TE/Insem]-526
tat
T.E. (Computer Engineering)
2s
THEORY OF COMPUTATION
8:1
02 91
(2019 Pattern) (Semester -I) (310242)
0:4
0
21
Time : 1 Hour] 4/1 13 [Max. Marks : 30
Instructions to the candidates:
0
0/2
.23 GP
8
C
23
4) Assume suitable data, if necessary.
ic-
16
tat
8.2
2s
.24
8:1
91
49
0:4
30
21
01
02
0/2
GP
4/1
CE
80
8
23
.23
tat
L={0m1n0m+n | m>=1 and n>=1} is not regular [5]
8.2
2s
.24
8:1
OR
91
49
0:4
P.T.O.
49
8
Q3) a) Convert the following RE to ε–NFA and find the ε–closure of all the
23
states and corresponding DFA. (0+1)*. 1.(0+1) [9]
ic-
tat
b) • The set of strings over {0,1} that have at least one 1. [6]
2s
8:1
• The set of strings over {0,1} that have at most one 1.
02 91
0:4
• The set of all strings over {0,1} ending with 00 and beginning with 1.
0
21
4/1 13 OR
0
0/2
.23 GP
8
C
23
ii) Find the string corresponding to s but not to r.
ic-
16
tat
iii) Find the string corresponding to both r & s.
8.2
2s
.24
8:1
iv) Find the string corresponding to neither r nor s.
91
49
0:4
b) Write regular expressions for the following languages over the alphabet
30
21
∑={a,b} [7]
01
02
8
iii) Find the shortest string that is not in the language represented by
23
.23
tat
8.2
2s
.24
8:1
91
49
0:4
30
21
01
02
0/2
GP
4/1
CE
80
.23
16
8.2
.24
TE/Insem-526
49