| 摘要 |
A lexical search apparatus (10) for detecting the occurrence of predetermined data strings within an input data string, and the methods or its operation. Input characters are collapsed into a smaller set of translated input characters. A state transition array stored in memory, TBL (14), guides a deterministic finite automaton in recognizing the occurrence of the target strings in the input data. Transition to a state corresponding to the terminal character of a target string is detected, and an index identifying the found target data string is provided. A search sequencer (60) provides for the coordination of translating the input characters, guiding the state transitions, and allowing identification of the particular target data string found. |
