0% found this document useful (0 votes)
17 views2 pages

TOC Que2

Uploaded by

pamate1130
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views2 pages

TOC Que2

Uploaded by

pamate1130
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total No. of Questions : 4] SEAT No.

8
23
P8556 [Total No. of Pages : 2

ic -
[Oct 22/TE/Insem]-526

ta t
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

1) Answer Q1 or Q2, Q3 or Q4.


2) Neat diagrams must be drawn wherever necessary.
E

3) Figures to the right side indicate full marks.


80

8
C

23
4) Assume suitable data, if necessary.

ic-
16

t
sta
8.2

Q1) a) Convert the given NFA–ε to an NFA to DFA. [10]

:12
.24

91
:48
49

10
30
22
01
/20
GP
4 /10
CE
80

8
23
.23

b) Define Pumping Lemma and apply it to prove the following


ic-
16

tat
L={0m1n0m+n | m>=1 and n>=1} is not regular [5]
8.2

2s
.24

8:1

OR
91
49

0:4

Q2) a) Convert following NFA to DFA [6]


30
21
01
02
0/2
GP
4/1
CE
80
.23
16

b) Design a Mealy machine that accepts strings ending in ‘00’ or ‘11’.


8.2

Convert the Mealy machine to the equivalent Moore machine [9]


.24

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 -
ta t
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

Q4) a) Consider the two RE r=0*+1*, s=01*+10*+1*0+(0*1)* [8]


E

i) Find the string corresponding to r but not to s.


80

8
C

23
ii) Find the string corresponding to s but not to r.

ic-
16

t
sta
iii) Find the string corresponding to both r & s.
8.2

:12
.24

iv) Find the string corresponding to neither r nor s.


91
:48
49

b) Write regular expressions for the following languages over the alphabet
10
30

∑={a,b} [7]
22
01
/20

i) All strings that do not end with ‘aa’.


GP
/10

ii) The set of all strings ending neither in b nor in ba


4
CE
80

8
iii) Find the shortest string that is not in the language represented by

23
.23

the regular expression a*(ab)*b*.


ic-
16

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

You might also like