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. > Why do the sets have to be finite? Anyway, here's a degenerate regex that includes + but matches a finite set of strings: /a+^/ :) Ronald ==== Want to unsubscribe from Fun With Perl? Well, if you insist... ==== Send email to <fwp-request@technofile.org> with message _body_ ==== unsubscribe