Kotesh K. Rao

Learn More
Given a list of n strings of length at most k, where l is length of the largest string. The object is to cover the strings by a minimal number of regular expressions r1, r2, r3………………..,r m for m≥1,such that a) Every string in the database satisfies at least one r i and b) Any string 'X' of length at most K satisfying r 1 +r 2 +r 3 +……………….+r m is at a(More)
  • 1