dfa确定有限自动机定义
In Deterministic Finite Automata (DFA), for a given input symbol the machine will move to which next state can be determined and hence it is named as deterministic automata. The number of states is finite in number and hence it is called finite automata. Combining both the characteristics it is called DFA or deterministic finite automata.
在确定性有限自动机(DFA)中 ,对于给定的输入符号,机器将移动到可以确定下一个状态的位置,因此将其称为确定性自动机。 状态的数量是有限的,因此称为有限自动机。 将这两个特征结合起来称为DFA或确定性有限自动机 。
Definition of a DFA in formal terms:
DFA的正式定义:
A DFA can be denoted by a 5-tuple (Q, ∑, δ, q0, F) where,
DFA可以用5元组( Q,∑,δ,q0,F )表示,其中,
Q is a set of states. The number of states are finite.
Q是一组状态。 状态数是有限的。
∑ is a set of symbols called the alphabet. They are finite in number.
∑是一组称为字母的符号。 它们的数量是有限的。
δ is the transition function. Here it maps Q × ∑ → Q
δ是转移函数。 在这里它映射