Forward Nondeterministic DAWG Matching

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

Appeared in:

• [64]: Holub, J., Durian, B.: Talk: Fast variants of bit parallel approach to suffix automata. In: The Second Haifa Annual International Stringology Research Workshop of the Israeli Science Foundation, http://www.cri.haifa.ac.il/events/2005/string/presentations/Holub.pdf ↗ (2005)