This post describes the construction of an Aho-Corasick automaton for the simultaneous matching of substrings within a sequence. I’m fond of this algorithm because it constructs an automaton from an existing tree data structure in a rather pleasant way.
post
there doesn't seem to be anything here
2 comments in c/programming@programming.dev view that post
replies:
no comments (yet)