An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata

DOI10.1007/978-3-642-31265-6_9zbMath1358.68161OpenAlexW2166136445MaRDI QIDQ2904484

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

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)

Related Items (1)

Stochastic analysis of minimal automata growth for generalized strings

This page was built for publication: An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata