A Pattern Matching Algorithm Using Deterministic Finite Automata with Infixes Checking
碩士 === 國立中興大學 === 資訊科學研究所 === 93 === This thesis presents two string matching algorithms. The first algorithm constructs a string matching finite automaton (called mc-DFA) for multi-class of keystrings with infix checking and then applies this mc-DFA to process the matching procedure for a given tex...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42273068520390912376 |