自动机 Finite State Automaton
Finite State Automaton
also called Finite State Machine, State Machine, 是一种计算数学模型，其根据输入时序信号将抽象机器从一种状态改变到另一种状态。
Deterministic Finite Automaton, DFA
(automata)
\[M=(Q,\Sigma, \delta, q_0, I, F)
\]
Non-deterministic Finite Automaton, NFA
DFA vs. NFA
given an input symbol, the next state is:
- deterministic. DFA
- non-deterministic. NFA
the top one is DFA, and the bottom one is NFA, because given input 1 from state p, the next state of the automation may be p or q, which is non-deterministic. However given any symbol from any state on the DFA, there is only one state will be transitioned.
Finite State Matchine Online Designer
References:
