| 摘要 |
The present invention relates to a method for selectively removing the nondeterminism of nondeterministic finite automata (NFA), including the steps of: (a) determining, as a maximum probability state, the highest probable state calculated to be reached when moving from a specific state; and (b) when common transitions are determined to exist, the common transitions being common between a first transition set consisting of transitions which move the maximum probability state to a state i and a second transition set consisting of transitions which move the maximum probability state to a state j, excluding the common transitions from the first and second transition sets, and generating a state k which is moved from the maximum probability state and reached by a common transition set which only consists of the common transitions. |
