# State Transition Diagram

*Edit*

**State Transition Diagram**. The basic idea is to define a machine that has a number of states (hence the term finite state machine). State diagrams require that the system described is composed of a finite number of states; sometimes, this is indeed the case, while at other times this is a reasonable abstraction.

State transition diagrams describe the logical transition of a system through various states of operation. State transition diagram demonstrates the states in the form of texts that are boxed and the transition is demonstrated through the arrows. In state transition table all the states are listed on the left side, and the events are described. state transition A graphical representation of a finite state machine diagram.

### State-transition diagrams describe all of the states that an object can have, the events under which an object changes state (transitions), the conditions that must be fulfilled before the transition will.

A state diagram is also known as a state transition diagram or state chart.

Note that none of the above given sets needs to be finite. In automata theory and sequential logic, a state-transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite-state machine will move to, based on the current state and other inputs. State diagrams require that the system described is composed of a finite number of states; sometimes, this is indeed the case, while at other times this is a reasonable abstraction.