Whenever its current state q is a member of A,the machine M has accepted the string read so far.An input that is not accepted is rejected. 问题11： 欲匹配的pattern-一定是可接受的 “语句”的后缀！ 你能将有限自动机与字符 串的识别联系起来吗？欲匹配的pattern一定是可接受的 “语句”的后缀！ Whenever its current state q is a member of A, the machine M has accepted the string read so far. An input that is not accepted is rejected