Extended finite state machine and search method for multiple regular expression associated search
A finite state machine and joint search technology, applied in the field of string search, can solve problems such as increasing the user's processing burden and complexity, and achieve the effect of processing string fallback and efficient parallel search
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0041] The core technical idea of the present invention is to expand the traditional non-deterministic finite state machine and deterministic finite state machine, and introduce state identification and state transition function identification to it, which the inventor named respectively as extended non-deterministic finite state machine machine and extended deterministic finite state machine, which are defined as follows:
[0042] Definition 1 Extended Nondeterministic Finite State Machine (E-NFA)
[0043] The extended non-deterministic finite state machine M is a nine-element formula, M=(Q, P, N, Vt∪{ε}, ρ, ω, δ, q0, F). in:
[0044] ◆The meanings of Q, Vt, ε, δ, q0, and F are the same as those of the corresponding parameters in the non-deterministic finite state machine;
[0045] ◆P represents a finite state identification set;
[0046] ◆N represents the finite state transition function identification set;
[0047] ◆ρ represents the mapping function between state and ...
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