A Table Compression Method for Extended Aho-Corasick Automaton

DOI10.1007/978-3-642-02979-0_12MaRDI QIDQ3637345zbMATH OpenOpenAlexFDO

Authors Yanbing Liu, Yifu Yang, Ping Liu, Jianlong Tan

Publication date 9 July 2009

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02979-0_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
• Construction of Aho Corasick automaton in linear time for integer alphabets
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• Compressed automata for dictionary matching
• Efficient dictionary matching by Aho-Corasick automata of truncated patterns

Cites work

• Efficient string matching
• scientific article; zbMATH DE number 2081049 (Why is no real title available?)
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• Improved behaviour of tries by adaptive branching
• Storing a sparse table
• Storing a Sparse Table with 0 (1) Worst Case Access Time

Cited in

(3)

• DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION
• Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
• Efficient pattern searching over large dictionaries

This page was built for publication: A Table Compression Method for Extended Aho-Corasick Automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637345)