CUDA by Example里附录A介绍了用cuda提供的API做一个mutex的方法。C++代码：struct Lock { int *mutex; Lock( void ) { int state = 0; HANDLE_ERROR( cudaMalloc( (void**)& mutex,

之前的方法需要一个个的字母读取，进行状态转移。这一节将不一个个字母读取。作者说，这种方法不一定所有情况都能用，所以下面把正则表达式改变了。这一节研究的不再是(AT|GA) ((AG|AAA)*) ，而是((GA|AAA)*) (TA|AG)，反过来了。给个图Figure 5.19: Glushkov automaton built on the regular expression

Another bit-parallel algorithm [NR99a, Nav01b, NR01a] uses Glushkov's NFA, which has exactlym + 1 states. We call itBPGlushkov.The reason to choose Glushkov over Thompson is that we need to build

这篇看起来很有难度。多次想放弃。慢慢来吧。不逐段翻译了，自己总结一下。  represents the states reachable from state i by characterσ without consideringε-transitions, andrepresents E(i), the ε-closure of state si (Section 5

5.3.1 Thompson's NFA simulation是现在许多相关算法的基础，作者没有仔细介绍，就不研究了。5.3.2Using a deterministic automatonOne of the early achievements in string matching was theO(n) time algorithm to search for a regul

The Thompson construction [Tho68] is simple and leads to an NFA that is linear in the number of states (at most 2m) and of transitions (at most 4m). However, this automaton has ε-transitions, that i