Backward-Nondeterministic-DAWG-Matching

Simulates the nondeterministic version of the automaton in Backward-DAWG-Matching.

Appeared in:

• [82]: Navarro, G., Raffinot, M.: A bit-parallel approach to suffix automata: Fast extended string matching. In: Farach-Colton [41], pp. 14–33, http://dx.doi.org/10.1007/BFb003077822 ↗ Simone Faro