Regular expression matching method based on smart finite automaton (SFA)
A finite automaton, expression matching technology, applied in special data processing applications, instruments, electrical digital data processing and other directions, can solve the problem of not judging whether auxiliary variables are set or not
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0037] In order to solve the redundant migration edge problem of XFA, this paper proposes a smart finite automaton (SFA), that is, on the basis of XFA, adding auxiliary variable judgment instructions, eliminating unnecessary state transitions, thereby reducing the storage space overhead of XFA and improving its matching efficiency. The source of inspiration for SFA is based on observations of DFA state transitions: as figure 1 As shown, when the string abababcd is read, the state transition sequence of DFA is P→Q→R→R→R→R→R→S→T, where state R repeats 5 times; since state R of DFA has memory Function, that is, the record has partially matched the string ab, waiting for the subsequent string cd, when a non-cd string is read, the DFA always migrates to the state R, and will not fall back to the state P or Q before R. Therefore, although XFA uses auxiliary variables and operation instructions to eliminate the problem of DFA state space explosion, it also deletes the memory functio...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com