Hi, I want to know some direction towards the problem of pattern matching with regular expressions. Suppose we are given two strings say S and T. Where S is pattern that can contain regular expression and T is some large string . Then how to say that S is substring of T.
Eg. S= ab.bc* T=adkksdk*abdb*sdfklsfd I want to know approaches apart from Finite automata construction. Is it possible to implement all the wild-chard characters in regex? What is the best data structure for this probem? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
