dfa与ndfa
DFA stands for Deterministic Finite Automata and NDFA stands for Non-Deterministic Finite Automata.
DFA代表确定性有限自动机，而NDFA代表非确定性有限自动机。
Read more: Deterministic Finite Automata (DFA)
： 确定性有限自动机(DFA)
DFA和NDFA之间的区别 (Difference between DFA and NDFA)
| DFA | NDFA |
|---|---|
| It stands for deterministic finite automata. | It stands for non-deterministic finite automata. |
| The transition takes place from a state to a single particular state for each input symbol. | For each input symbol, the transition can be to multiple next states. |
| There are no empty string transitions in DFA. | Empty string transitions are also permitted. |
| Backtracking is allowed in DFA. | In NDFA, it is not always possible to backtrack. |
| DFA requires more space. | NDFA requires less space. |
| There no such randomness as the transition can be determined in DFA. | There is much more randomness as the transition from one state to other cannot be determined in this. |
| Ex: δ: Q × ∑ → Q | Ex: δ: Q × ∑ → 2Q |
| DFA | 国家发改委 |
|---|---|
| 它代表确定性有限自动机。 | 它代表非确定性有限自动机。 |
| 对于每个输入符号，从状态转换到单个特定状态。 | 对于每个输入符号，过渡可以是多个下一个状态。 |
| DFA中没有空字符串过渡。 | 也允许空字符串过渡。 |
| DFA中允许回溯。 | 在NDFA中，并非总是可以回溯。 |
| DFA需要更多空间。 | NDFA需要更少的空间。 |
| 没有这种随机性，因为可以在DFA中确定过渡。 | 由于不能确定从一种状态到另一种状态的转变，因此存在更多的随机性。 |
| 例：δ：Q×∑→Q | 例：δ：Q×∑→2 Q |
翻译自: https://www.includehelp.com/toc/DFA-vs-NDFA.aspx
dfa与ndfa
