【作者单位】a College of Computer Science and Technology, Jilin University, Changchun, China b Department of Computer Science, Jilin Business and Technology College, Changchun, China
【摘要】 We present a simple and faster solution to the problem of matching a set of patterns with variable length don''t cares. Given an alphabet Σ, a pattern p is a word , where is a string over Σ called a keyword and is a symbol called a variable length do...
