English: A visualization of the finite state machine generated by the Aho-corasick string matching algorithm for a dictionary consisting of the following words: "a ab bc bca c caa bab". The blue edges are suffix links and the green edges are dict suffix links. This data structure can be considered a trie with additional links between internal nodes. These additional links enable fast transitions between failed pattern matches. This diagram was generated using my Aho-Corasick diagram generator.