Skip to content
Related Articles

Related Articles

GATE | GATE CS 1997 | Question 69
  • Last Updated : 30 Oct, 2017

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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :