Consider the following two finite automata. $M_1$ accepts $L_1$ and $M_2$ accepts $L_2$.
Which one of the following is TRUE?
both machine are containing 11 as substring so i said equal or other way to test convert nfa to dfa and then minimize the dfa bcz dfa can have more state in comparision to nfa. after minimizing you got both equal
$L_1: (0 + 10)^*11(0 + 1)^* $
$L_2: (0 + 1)^*11(0 + 1)^*$
It is quite clear that $L_1 = L_2$. As both languages $L_1$ and $L_2$ are equal So Complement of Language $L_2$ will be the complement of Language $L_1$ also. For a given language $L, L \cap L^{c} = \emptyset.$ Hence, both options (A) and (C) are correct.
IF L1=L2 then option c L1 ∩ L2' = ∅ is also correct..so both A and C correct
@Praveen Saini @kumar_sanjay Sir, if R.E are
L1: (0 + 10)*11(0 + 1)* L2: (0 + 1)*11(0 + 1)*
then people got L1=L2, but from L1 we can generate 1011, but how to generate string 1011 from L2?
Then how can L1=L2 ?!
@ Praveen Saini You're the best, Sir!
Hi @Praveen Saini ji,
L1=L2 , L1 is subset of L2 and L2 is subset of L1.
Correct. But how can we prove above mentioned statement ?
Hi @Praveen Saini ji Thank You.
you can find the minimized DFA for M1 and M2. if you get the same then L1 = L2
Can not we obtain two different minimized DFA for same L ?
If Yes the $M_{1}$ XOR $M_{2}$ == $\phi$ may help.
One more thing is there any other more faster way to do this.
@Praveen Saini Sir, I am having difficulty understanding how Regular expressions for L1 and L2 are equivalent. Particularly the part (0+10)* and (0+1)*. My actual doubt is , suppose R.E1= (0+10)* and R.E2 = (0+1)* , are they equal in this case too? No, right?
@Ajitgate21 M2 also can generate L2 (1011). Follow these states for L2 : $AABC$ Recheck once more.
@Abhrajyoti00 Thank you for reply
Answer: A.
option c) cannot be right as complement concept is only applicable for DFA.
@swagat
We are not applying Complement on NFA. We are applying complement on the Language (i.e. $L_{2}$) accepted by given NFA. Therefore, A and C are Correct.
In this L1 = (0+10)* 11(0+1)* L2 = (0=1)* 11(0+1)* Both L1 and L2 are equal. Option A is correct. → L1 ∩ L2‘ = L1 ∩ L1‘ = ∅ (option C also correct)
64.3k questions
77.9k answers
244k comments
80.0k users