Never design a language with exceptions that do not also have deterministic resource deallocation.
不要设计一门没有确定的资源（时机）释放的语言。
2
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.