Question: Let L = { w i n { a , b } * * : n a ( w ) 1 n b ( w

Let L={win{a,b}**:na(w)1nb(w)=2
} Let M1, M2, M3, M4 be the following
NFAs. For each NFA determine whether
or not the NFA accepts L. If the NFA does
not accept L, give a string that is in L that
is not accepted by the NFA.
M1
a. Does L(M1)=L? If L(M1)M then
find a string w that belongs to L that is
not accepted by M1.
M2
b. Does L(M2)=L? If L(M2)L then
find a string w that belongs to L that is
not accepted by M2.
??????2
c. Does L(M3)=L? If L(M3)M then
find a string w that belongs to L that is
not accepted by M3.
M4
d. Does L(M4)=L? If L(M4)M then
find a string w that belongs to L(M4) but
does not belong to L.
 Let L={win{a,b}**:na(w)1nb(w)=2 } Let M1, M2, M3, M4 be the following

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!