String Matching
seminar surveyer Active In SP Posts: 3,541 Joined: Sep 2010 
16102010, 11:47 AM
Prepared by: Diwakar Pandey Diwakar Pandey.ppt (Size: 1.8 MB / Downloads: 99) 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} 



Important Note..!
If you are not satisfied with above reply ,..PleaseASK HERE
So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this pagePossibly Related Threads...  
Thread  Author  Replies  Views  Last Post  
Numerical Approximation of the Exact Control for the String Equation  seminar flower  0  636 
13082012, 03:31 PM Last Post: seminar flower 