Invention Grant
US09251290B2 Method, server, terminal device, and computer-readable recording medium for selectively removing nondeterminism of nondeterministic finite automata
有权
方法，服务器，终端设备和计算机可读记录介质，用于选择性地去除非确定性有限自动机的非确定性
- Patent Title: Method, server, terminal device, and computer-readable recording medium for selectively removing nondeterminism of nondeterministic finite automata
- Patent Title (中): 方法，服务器，终端设备和计算机可读记录介质，用于选择性地去除非确定性有限自动机的非确定性
-
Application No.: US14391503Application Date: 2012-12-24
-
Publication No.: US09251290B2Publication Date: 2016-02-02
- Inventor: Min Sik Kim
- Applicant: INFNIS NETWORKS, INC.
- Applicant Address: KR Seoul
- Assignee: INFNIS NETWORKS, INC.
- Current Assignee: INFNIS NETWORKS, INC.
- Current Assignee Address: KR Seoul
- Agency: Husch Blackwell LLP
- Priority: KR10-2012-0038763 20120413
- International Application: PCT/KR2012/011372 WO 20121224
- International Announcement: WO2013/154252 WO 20131017
- Main IPC: G06F17/00
- IPC: G06F17/00 ; G06F17/30
Abstract:
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.
Public/Granted literature
Information query
