The state diagram is a directed graph for a finite automaton in which
- vertices indicate states
- arcs show transitions between two states
In practice, vertices are usually depicted as circles and, if necessary, double circles. In UML notation, states are represented by rectangles with rounded corners [1] .
Content
Examples
S 1 and S 2 are states. Arcs are marked with input data.
S 0 , S 1 and S 2 are states. The arcs are labeled j / k , where j is the input, and k is the output.
Notes
Literature
- John Hopkroft , Rajiv Motvani, Jeffrey Ullman. Introduction to Automata Theory, Languages and Computations = Introduction to Automata Theory, Languages, and Computation. - M .: Williams , 2002. - 528 p. - ISBN 0-201-44124-1 .
See also
- THE DRAGON