资 源 简 介
DFA的“语言”是这个DFA接受的所有的串的集合。假设a1a2…an是输入符号序列，让这个DFA从初始状态q0开始运行。查询转移函数δ，比如说δ(q0,a1)=q1，以找出DFA在处理了第一个输入符号a1之后进入的状态。处理下一个输入符号a2，求δ(q1,a2)的值，假设这个状态是q2。以这种方式继续下去，找出状态q3,q4,…,qn，使得对每个i，δ(qi-1,ai)=qi。如果qn属于F，则接受输入a1a2…an，否则就“拒绝”。-DFA" s " language" is the DFA to accept all of the string collection. A1a2 ... an assumption is an input symbol sequence, so that the DFA into operation from the initial state q0. Look transfer function δ, say δ (q0, a1) = q1, in order to identify the DFA in dealing with the first input into the state after the symbol a1. To the next input symbol a2, seeking δ (q1, a2) values, assuming that this state is q2. Continue in this way to find out the state q3, q4, ..., qn, making for every i, δ (qi-1, ai) = qi. If qn belongs to F, then accept the input a1a2 ... an, otherwise, " refuse."
