Automaton is a popular data structure with many applications. We present implementation methods of deterministic finite automaton that allow both efficient space usage and performance. The first method utilizes the succinct data structures to speedup the computation of the transition function. The m