It is important in theory and practice to translate a NFA into DFA. So far, subset construction is the most popular method. The method, however, needs import a dummy input ε and ε-closure and has a complicated computing procedure. In this paper, a new method to translate a NFA into DFA straightly is described. The new method needn’t import a dummy input ε and ε-closure, it accords to the original NFA state graph or state shift table to translate a NFA into DFA straightly.