Dori, Shiri; Landau, Gad M. Construction of Aho Corasick automaton in linear time for integer alphabets. (English) Zbl 1130.68313 Apostolico, Alberto (ed.) et al., Combinatorial pattern matching. 16th annual symposium, CPM 2005, Jeju Island, Korea, June 19–22, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26201-6/pbk). Lecture Notes in Computer Science 3537, 168-177 (2005). Summary: We present a new simple algorithm that constructs an Aho Corasick automaton for a set of patterns, \(P\), of total length \(n\), in \(O (n)\) time and space for integer alphabets. Processing a text of size \(m\) over an alphabet \(\Sigma\) with the automaton costs \(O(m\log \left|\Sigma\right| + k)\), where there are \(k\) occurrences of patterns in the text.For the entire collection see [Zbl 1076.68002]. Cited in 2 Documents MSC: 68R15 Combinatorics on words 68P05 Data structures 68Q45 Formal languages and automata × Cite Format Result Cite Review PDF Full Text: DOI