Fig. 8
From: Infrared: a declarative tree decomposition-powered framework for bioinformatics
Sketch of the 5-state Deterministic finite “Aho-Corasick” automaton accepting the three stop codons UGA, UUA, UUG. We do not draw back-transitions to \(q_0\), which occur implicitly for all not explicitly shown cases (i.e. A,C,G in \(q_0\); C in \(q_1\), C,G in \(q_2\); and C in \(q_3\)). To forbid, instead of accept, all of the three stop codons, we complement the language by making all states but \(q_4\) accepting