Home > Term: deterministic finite automata string search
deterministic finite automata string search
A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match.
- ส่วนหนึ่งของคำพูด: noun
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
- 100% positive feedback