1. A computer implemented method for traversing a deterministic finite automata-based graph comprising: traversing nodes in the graph, the nodes being interconnected through valid arcs, with a walker process to search for an expression in an input stream; and upon reaching a valid arc, generating a hash value to manage the walker process.