Factorized BNDM

Simulates the nondeterministic version of the automaton in Backward-Nondeterministic-DAWG-Matching using a more compact representation of the automaton. It is based on a factorization of the pattern.

Appeared in:

• [26]: Cantone, D., Faro, S., Giaquinta, E.: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. In: Amir, A., Parida, L. (eds.) Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6129, pp. 288–298. Springer (2010), http://dx.doi.org/10.1007/978-3-642-13509-5_26 ↗
• [27]: Cantone, D., Faro, S., Giaquinta, E.: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213, 3–12 (2012), http://dx.doi.org/10.1016/j.ic.2011.03.006 ↗