确定型有限状态机的实现：把DFA的五元组存在文本文件中，输入一个字符串可以判断能否被该机器所接受-Determine the type of the realization of finite state machine: the DFA Five-Tuple of the existence of a text file, type a string can be judged can be accepted by the machine