Theory Of Computation MCQ

1:

 If two finite states machine M and N are isomorphic, then

A. M can be transformed to N, merely re-labelling its states
B. M can be transformed to N, merely re-labelling its edges
C. Both (a) and (b)
D. None of these
 

Answer : A

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.