in Theory of Computation retagged by
1,478 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
in Theory of Computation retagged by
by
1.5k views

3 Comments

B option is correct
0
0
option b is correct.
0
0
edited by
0
0

2 Answers

2 votes
2 votes
Best answer

A,C. Not true. Transition between the states maybe different and hence language accepted.

We say that two DFAs A1 and A2 are equivalent iff L(A1) = L(A2).

B is correct.

Ref: https://www.cse.iitb.ac.in/~trivedi/courses/cs208-spring14/lec05.pdf

selected by
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