Abstract
We present a novel technique, suitable for bit-parallelism, for representing both the nondeterministic automaton and the nondeterministic suffix automaton of a given string in a more compact way. Our approach is based on a particular factorization of strings which on the average allows to pack in a machine word of w bits automata state configurations for strings of length greater than w. We adapted the Shift- And and BNDM algorithms using our encoding and compared them with the original algorithms. Experimental results show that the new variants are generally faster for long patterns. © Springer-Verlag Berlin Heidelberg 2010.
Cite
CITATION STYLE
Cantone, D., Faro, S., & Giaquinta, E. (2010). A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6129 LNCS, pp. 288–298). https://doi.org/10.1007/978-3-642-13509-5_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
