1. A computer implemented method for generating a bit map for a deterministic finite automata based graph, the method comprising: analyzing valid arcs in the graph to determine a structural configuration of a current node being pointed to by a valid arc of a prior node; constructing a respective bit map for each valid arc based on the structural configuration; and storing the respective bit map of the current node in the valid arc of the prior node.