10-04-2017, 09:33 PM
Prepared by:
Diwakar Pandey
[attachment=6254]
Introduction
String Matching:
string matching is an algorithm that try to find a string of length m(called pattern)
from a string of length n (called text).
Text :- Text is an array T[1 .n] of length n.
Pattern:- Pattern is an array P[1 ..m] of length m , where m n.
Finite alphabet :- It is a finite set of characters . The elements are taken from T and P.It is denoted by .
Eg:- = {0,1}
= {a,b,c, z}
= { 0,1, ..9}
Diwakar Pandey
[attachment=6254]
Introduction
String Matching:
string matching is an algorithm that try to find a string of length m(called pattern)
from a string of length n (called text).
Text :- Text is an array T[1 .n] of length n.
Pattern:- Pattern is an array P[1 ..m] of length m , where m n.
Finite alphabet :- It is a finite set of characters . The elements are taken from T and P.It is denoted by .
Eg:- = {0,1}
= {a,b,c, z}
= { 0,1, ..9}