摘要
本文讨论了字符串的连续匹配、离散匹配及求解最长公共子串的自动机算法。
In this paper,the automat algorithm of the string matching is discussed.It includes continuous matching、dispersed matching and the longest common substring be solved.Three matching algorithm formalizations also are given respectively.
出处
《计算机应用》
CSCD
1996年第4期26-28,共3页
journal of Computer Applications
关键词
字符串
匹配
自动机
最长公共子串
String,Matching,Automata,Longest common substring
