GATE | GATE CS 1997 | Question 69

Following is a state table for some finite state machine.

TTT

A). Find the equivalence partition on the states of the machine.
B). Give the state table for the minimal machine. (Use appropriate names for the equivalent states. For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine.)







Answer:

Explanation:

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.