A state is a description of the status of a system that is waiting to execute a transition. A transition is a set of actions to be executed when a condition is fulfilled or when an event is received. An FSM M is said to be completely specified if from each state in M there exists a transition for each input symbol. An FSM M is considered strongly connected if for each pair of states (qi , qj ) there exists an input sequence that takes M from state qi to qj. States qi and qj are said to be equivalent if O1(qi , r) = O2(qj , r) for any set V, i.E., they yield identical output sequences. If qi and qj are not equivalent, then they are said to be distinguishable.