US 12,423,228 B2
Bit-packing method for lightening NFA data structure in extended regular expression matching process, apparatus and computer program for performing the method
Yo-Sub Han, Seoul (KR); JoongHyuk Hahn, Seoul (KR); and Sicheol Sung, Seoul (KR)
Assigned to UIF (University Industry Foundation), Yonsei University, Seoul (KR)
Filed by UIF (University Industry Foundation), Yonsei University, Seoul (KR)
Filed on Dec. 5, 2022, as Appl. No. 18/061,849.
Claims priority of application No. 10-2022-0136486 (KR), filed on Oct. 21, 2022.
Prior Publication US 2024/0134791 A1, Apr. 25, 2024
Prior Publication US 2024/0232076 A9, Jul. 11, 2024
Int. Cl. G06F 12/06 (2006.01)
CPC G06F 12/0646 (2013.01) [G06F 2212/1056 (2013.01)] 12 Claims
OG exemplary drawing
 
1. A bit-packing method for lightening a nondeterministic finite state automation (NFA) data structure in an extended regular expression matching process, comprising:
generating a nondeterministic finite state automation (NFA) corresponding to an extended regular expression; and
storing the nondeterministic finite state automation (NFA) according to a previously determined bit-packing reference,
wherein the generating of a nondeterministic finite state automation (NFA) is configured by generating the nondeterministic finite state automaton (NFA) corresponding to the extended regular expression using a Glushkov automaton transformed such that trunk lines starting from one vertex have the same label.