### Abstract

We address a variant of the dictionary matching problem where the dictionary is represented by a straight line program (SLP). For a given SLP-compressed dictionary D of size n and height h representing m patterns of total length N, we present an O(n^{2}log N)-size representation of Aho-Corasick automaton which recognizes all occurrences of the patterns in D in amortized O(h+m) running time per character. We also propose an algorithm to construct this compressed Aho-Corasick automaton in O(n^{3}log n log N) time and O(n^{2}log N) space. In a spacial case where D represents only a single pattern, we present an O(n log N)-size representation of the Morris-Pratt automaton which permits us to find all occurrences of the pattern in amortized O(h) running time per character, and we show how to construct this representation in O(n^{3}log n log N) time with O(n^{2}log N) working space.

Original language | English |
---|---|

Pages (from-to) | 30-41 |

Number of pages | 12 |

Journal | Theoretical Computer Science |

Volume | 578 |

DOIs | |

Publication status | Published - May 1 2015 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*578*, 30-41. https://doi.org/10.1016/j.tcs.2015.01.019