掌握有穷状态自动机的概念，其存储表示及其与正则文法的联系输入：任意的正则文法 输出：相应的有穷状态自动机

识别有穷状态自动机是确定的还是非确定的 以相应的五元组形式输出-Control finite state machine concept, the store said its relationship with regular grammars contact input: any regular grammar Output: the corresponding finite state automata recognize finite state machine is defined and non defined in the corresponding five-tuple form of output