论文部分内容阅读
String matching algorithms play an important role in computer science. However, there is no uniform mathematical model to describe these algorithms. Thus, read-head-Skippable DFA (SDFA) is put forward, which is an extension of two-way DFA. It is proved th