说明：  简单DFA有穷自动机，可以根据输入的状态转换表，进行状态转换，对输入的字符串判断，该自动机是否可以接受。并有具体报告说明。
(Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific reporting instructions.)