String Matching
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
seminar surveyer
Active In SP
**

Posts: 3,541
Joined: Sep 2010
#1
16-10-2010, 11:47 AM


Prepared by:
Diwakar Pandey


.ppt   Diwakar Pandey.ppt (Size: 1.8 MB / Downloads: 98)


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}
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK 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 page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Numerical Approximation of the Exact Control for the String Equation seminar flower 0 627 13-08-2012, 03:31 PM
Last Post: seminar flower