![](/sites/all/themes/searchivarius/images/empty.gif) |
|
|
![](/sites/all/themes/searchivarius/images/empty.gif) |
![](/sites/all/themes/searchivarius/images/page_ugol1.gif) |
![](/sites/all/themes/searchivarius/images/page_top.gif) |
![](/sites/all/themes/searchivarius/images/page_ugol2.gif) |
![](/sites/all/themes/searchivarius/images/empty.gif) |
![](/sites/all/themes/searchivarius/images/empty.gif) |
![](/sites/all/themes/searchivarius/images/empty.gif) |
A finite state machine (FSM) or finite state automaton (plural: automata) is a model of behavior composed of states, transitions and actions. A state stores information about the past, i.e. it reflects the input changes from the system start to the present moment. A transition indicates a state change and is described by a condition that would need to be fulfilled to enable the transition Read more
|
|
|
![](/sites/all/themes/searchivarius/images/page_right.gif) |
![](/sites/all/themes/searchivarius/images/empty.gif) |
![](/sites/all/themes/searchivarius/images/empty.gif) |
![](/sites/all/themes/searchivarius/images/page_ugol4.gif) |
![](/sites/all/themes/searchivarius/images/page_bottom.gif) |
![](/sites/all/themes/searchivarius/images/page_ugol3.gif) |
![](/sites/all/themes/searchivarius/images/empty.gif) |
|