retagged by
1,523 views
2 votes
2 votes

Given two DFA's $M1$ and $M2$. They are equivalent if

  1. $M1$ and $M2$ has the same number of states
  2. $M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$
  3. $M1$ and $M2$ has the same number of final states
  4. None of the above
retagged by

2 Answers

0 votes
0 votes
Option B) is correct , Given two DFA’s then they are equal if both accepts the same language.
Answer:

Related questions

3 votes
3 votes
2 answers
2
admin asked Mar 31, 2020
1,123 views
$(00+01+10)(0+1)^*$ representsStrings not starting with $11$Strings of odd lengthStrings starting with $00$Strings of even length
2 votes
2 votes
3 answers
3
admin asked Mar 31, 2020
765 views
If $L1$ is CFL and $L2$ is regular language which of the following is false?$L1-L2$ is not Context free$L1$ intersection $L2$ is Context free$\sim L1$ is Context freeBoth...
2 votes
2 votes
3 answers
4