1. A computer implemented method for generating a deterministic finite automata-based graph comprising: storing a graph of expressions in memory, the graph including a plurality of nodes interconnected by arcs; and pruning the arcs in a manner allowing the plurality of nodes to be interconnected solely by one or more valid arcs, where a current valid arc interconnects a current node to a next node, the current valid arc representing a character match in an expression of a character associated with the current node.