Compressed automata for dictionary matching

Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution


A variant of the dictionary matching problem is addressed where the dictionary is given in an SLP-compressed form. An Aho-Corasick automata-based algorithm is presented which pre-processes the compressed dictionary D in O(n4log n) time using O(n2 log N) space and recognizes all occurrences of the patterns in D in amortized O(h + m) running time per character, where n and N are, respectively, the compressed and uncompressed sizes of D, and h is the height of D, and m is the number of patterns in the dictionary.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783642392733
Publication statusPublished - 2013
Event18th International Conference on Implementation and Application of Automata, CIAA 2013 - Halifax, NS, Canada
Duration: Jul 16 2013Jul 19 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other18th International Conference on Implementation and Application of Automata, CIAA 2013
CityHalifax, NS

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Compressed automata for dictionary matching'. Together they form a unique fingerprint.

Cite this