Question 1: Which of the following strings is NOT in the Kleene

closure of the language {011, 10, 110}?

1001110 incorrect

11010110

1101010

01110111

11010110

1001110

01110011 incorrect

11001010

011011110

1101010 incorrect

110011110

01110111

10110110

01110111

11010110 incorrect

011011110

110011110

0111010

011011110

11001010 correct

10110011

01110011
01110111 correct

1101010

L(00011101), i.e., the language of regular expression

(0+1)*00011101.

L(110101) is disjoint from L. incorrect

L(1111001) is contained in L.

L(11011) is neither disjoint from L nor contained in L.

L(00011101) is contained in L.

L(1111001) is disjoint from L.

L(1111001) is contained in L. incorrect

L(110101) is contained in L.

L(00011101) is neither disjoint from L nor contained in L.

L(00011101) is neither disjoint from L nor contained in L. incorrect

L(1111001) is disjoint from L.

L(11011) is disjoint from L.

L(00011101) is disjoint from L.

L(11011) is contained in L.

L(00011101) is disjoint from L.

L(00011101) is neither disjoint from L nor contained in L.

L(110101) is contained in L. incorrect

L(11011) is contained in L.

L(110101) is disjoint from L.

L(00011101) is disjoint from L. incorrect

L(11011) is disjoint from L.

L(110101) is contained in L.
L(00011101) is neither disjoint from L nor contained in L.

L(1111001) is disjoint from L. correct

L(1111001) is neither disjoint from L nor contained in L.

from A to B without passing through any of the four states.

LAB = 0*1(01)* incorrect

LAA = (0+10)*

LBB = (0(00*10)*)*

LBA = (00*1+10)*0

LBB = (0*1)*

LBB = (0(00*10)*)* incorrect

LAB = (0+10+01)*1

LAB = 0*1(00*1)*

LBA = (01+0)*

LAA = (0+10)* correct

LAB = 0*1(01+10)*

LAB = (0+10+01)*1

(00+01+10+11)*1

(0+1)*1+ correct

(0+1)*10*

(0*+1)*

LBB = 0(0*1)* incorrect

LAB = (0+10+01)*1

LBA = 0(00*10)*

LBA = 0(0+10)*

LBB = (0*1)* incorrect

LAB = (0+10+01)*1

LBA = 0(0+10)*

LAB = 0*1(01+10)*

LAB = (0+10+01)*1

LAB = 0*1(01+10)*

LAA = (0+1(10)*0)*

LBA = 0(0+10)* correct

uestion 4: Identify from the list below the regular expression that
generates all and only the strings over alphabet {0,1} that end in 1.

(0*+1)+ incorrect

(0+1+)*1

0+(0+1)*1

(0?+1+)*1

0+(0+1)*1 incorrect

(0*+1)+

(0*1)*

(0?+1+)*1
(0*1)*

(0*+1)*

(0?+1+)*1 correct

(0+1)*1+1

(0+1)*10?

(00+01+10+11)*1

(0*1)*

(0?+1+)*1 correct

(0+1)*1+1

(0?+1+)*1 correct

(0+1+)*1

(0*1)*

(0*+1)+

(0?+1+)*1 correct

(0+1)*10?

1*0*1

on 5: Apply the construction given in the video lectures to convert the

regular expression (0+1)*(0+ε) to an epsilon-NFA. Then, identify the
true statement about your epsilon-NFA from the list below

There are 12 arcs labeled ε. incorrect

There are 14 states.

There are 16 states.

There are 2 states with more than one arc in.

There are 12 states with more than one arc in.

There are 12 arcs labeled ε.

There are 2 states with more than one arc in. incorrect

There are 14 arcs labeled ε.

There are no states with more than one arc in.

There are 2 states with more than one arc in.

There are 7 states.

There are 14 states. Correct

There are 17 arcs labeled ε.

There are 12 arcs labeled ε.

There are 14 states. correct

There are 12 states with more than one arc in.

There are 6 states with more than one arc out.

There is 1 arc labeled ε.

There are 17 arcs labeled ε.

There are 14 arcs labeled ε. Correct

There are 5 states with more than one arc out.

There are 14 states. correct

There are 12 arcs labeled ε.

There are 12 states with more than one arc in.