Two finite state machines are said to be equivalent if they
| A. | have same number of states |
| B. | have same number of edges |
| C. | have same number of states and edges |
| D. | recognize same set of tokens |
Answer : C Explanation : Jugraj said: (2:11am on Sunday 28th April 2013)
i think answer should be D not C because two FSM are equivalent if they accept same set of strings
mmam said: (8:30pm on Friday 17th May 2013)
yes ,Jugraj answer is very correct
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
