METHOD, SERVER, TERMINAL DEVICE, AND COMPUTER-READABLE RECORDING MEDIUM FOR SELECTIVELY REMOVING NONDETERMINISM OF NONDETERMINISTIC FINITE AUTOMATA

摘要

A method for selectively eliminating nondeterministic elements of NFA is disclosed. The method includes steps of: (a) determining a specific state calculated to have a highest arrival probability through a transition from a current state among all states in the NFA as a current highest probability state; (b) determining whether there exists at least one common transition between a first set of transitions including at least one transition moving the current highest probability state to a state i and a second set of transitions including at least one transition moving the current highest probability state to a state j in the NFA; and (c) excluding the at least one common transition between the first and the second sets of transitions and creating a state k which is arrived as a result of moving from the current highest probability state through the at least one common transition.