Regular expressions are a notation for concisely some sets of strings. Let’s talk about the subset of regular expressions where the only operator available is the
? operator from traditional regular expressions. For example,
ab(cde)? is a regular expression for the language . Let’s adopt a different notation for this, given that it’s the only logic we need to express. I want to use square brackets. So the previous regular expression would be written as
ab[cde]. I’m calling this notation “template expressions” because I’m using these for a kind of templating application.
As another example,
a[bc]de[f] is a template expression describing the set .
Here’s my problem. I have a set of strings and want to find the shortest template expression which produces all of them.
I’m fine if the template expression also produces other strings which are not in my set. This means that it’s trivial to come up with a bad solution, because for any set of strings, eg , you can make a template expression like
[X][Y][Z] which solves the problem.
(We need to choose a cost function for templates. For the moment, I’m happy to use the cost function which is just the number of total characters in the template.)
Suppose you know the optimal way of editing string to string using only insertions and deletions. If this takes insertions, then you can make a template for the set with cost .
Obvious extension: how do you do this if you have more logical operators available? I’m particularly interested in the “or” operator. So for example the regular expression
(a|b)cd which matches .
If you allow the Kleene star operator, you can quickly make a regular expression to match anything, which makes it trivial to find a regex which matches all of the strings in a set.