On Fri, May 25, 2001 at 10:57:46PM -0400, Mark Rogaski wrote: > An entity claiming to be Abigail (abigail@foad.org) wrote: > : > : BTW, an interesting exercise would be to prove that a certain regex > : only matches a certain set of strings, and no other strings. > : > > If you mean that the sets are finite, then the regex cannot include *, +, > or any other unbounded repetition. No, I don't mean finite. The absense of repetitors might make it easier to prove a regex matches a set, and nothing but the set, but I don't think the set being finite makes it any easier. Abigail ==== Want to unsubscribe from Fun With Perl? Well, if you insist... ==== Send email to <fwp-request@technofile.org> with message _body_ ==== unsubscribe