info@avatto.com
+91-9920808017
56. If two finite states machine M and N are isomorphic, then
M can be transformed to N, merely re-labelling its states
M can be transformed to N, merely re-labelling its edges
none of these
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
57. Regular expression corresponding to the state diagram given in the figure is
(0+1(1 + 01)* 00)*
(1 + 0 (0 + 10) 00)*
(0 + 1 (1 + 10) 00)*
(1 + 0(1 + 00) 11)*
58. Two finite state machines are said to be equivalent if they
have same number of states
have same number of edges
have same number of states and edges
recognize same set of tokens
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
