An efficient linear pseudo-minimization algorithm for Aho-Corasick automata

DOI10.1007/978-3-642-31265-6_9MaRDI QIDQ2904484zbMATH OpenOpenAlexFDO

Authors Omar Aitmous, Frédérique Bassino, Cyril Nicaud

Publication date 14 August 2012

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_9

Mathematics Subject Classification ID

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

Recommendations

• Construction of Aho Corasick automaton in linear time for integer alphabets
• Combinatorial Pattern Matching
• Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• scientific article; zbMATH DE number 1045407

Cited in

(10)

• Stochastic analysis of minimal automata growth for generalized strings
• Subset Seed Automaton
• EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA
• Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
• A Table Compression Method for Extended Aho-Corasick Automaton
• A note on mc-DFA and its minimization
• Combinatorial Pattern Matching
• Linear-time minimization of Aho-Corasick automaton
• Minimized compact automaton for clumps over degenerate patterns
• Construction of Aho Corasick automaton in linear time for integer alphabets

This page was built for publication: An efficient linear pseudo-minimization algorithm for Aho-Corasick automata

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