利用有穷确定自动机M=(K,Σ,f, S,Z）行为模拟程序算法，来对于任意给定的串，若属于该语言时，该过程经有限次计算后就会停止并回答“是”，若不属于，要么能停止并回答“不是”-Use poor to determine the automaton M = (K, sigma, F, S, Z) behavior simulation program algorithm, for any given string belongs to the language, the process is c