FSM

FSM

1.acceptor & transducer

Acceptors :Input是否被FSM接收

produce a binary output, saying either yes or no to answer whether the input is accepted by the machine or not. All states of the FSM are said to be either accepting or not accepting. At the time when all input is processed, if the current state is an accepting state, the input is accepted; otherwise it is rejected. As a rule the input are symbols (characters); actions are not used.

transducer:对input产生output,也就是对Input产生输出，比如电梯控制，

generate output based on a given input and/or a state using actions.They are used for control applications and in the field of computational linguistics.

Determinism：

In deterministic automata, every state has exactly one transition for each possible input.

In non-deterministic automata, an input can lead to one, more than one or no transition for a given state.

Opimization:

最少的state 同样的效果

Mathmatics：

1.acceptor:

五元组,Input, States, InitialStates, FinalStates, state-transition function

2.transducer:

六元组：Input, Output States, InitialStates, state-transition function, Output Function,