Spam Detection with DFA/NFA: Detects spam phrases using deterministic finite automata (DFA) built from a set of patterns. Patterns are compiled from NFA to DFA for fast substring matching.

Takes a DFA description and a list of strings as input, and prints accept or reject to stdout for each string. DFA descriptions should be formatted like so: Number of ...