NIST defines the finite state machine (FSM) as follows. A set of state sets, start states, a set of input symbols, a mapping input symbol, and the current state to the computational model of the transition function (Transition function). When the symbol string is input, the model will enter the starting state. It has to change to a new state, depend on the conversion function. In a finite state machine, there will be many variables, for example, the state machine has many actions associated with the action (MEALY machine) or status (mole), multiple start state, based on the conversion without input symbol, or A plurality of transitions of the specified symbol and state (non-fixed state), assign one or more states of the receiving state (recognizers), and so on.
one example
The above figure is an acceptor FSM model for analyzing the word "nice". The analyzer only accepts characters input, including 6 states, and status switches by the input character drive. It is very simple to understand, which is not explained here.
Thank Hongyun Seniors to guide the translation of this paper.
(Note that the reference should indicate the original author posted this article:! Rosen Jiang and Source: http: //blog.9cbs.net/rosen)
