Re: Self-recognizing programs and regular expressions
Josh Goldberg <[email protected]>
| Newsgroups | gmane.comp.lang.perl.fun |
|---|---|
| Message-ID | <[email protected]> |
How does this look?
^.[\\\[\]{}18.]{18}.$
On Mar 7, 2005, at 1:57 PM, Jasvir Nagra wrote:
>
> The challenge then is to find a regular expression inequ or failing
> that, the regular expression that accepts the smallest set of strings
> including itself. The score of an entry is the size of the set of
> strings it accepts. If two regular expressions find the same size set
> of strings, the shorter regular expression wins.
>
> I will summarise entries at
> http://www.cs.auckland.ac.nz/~jas/toys/inequ.html#score
>
> The par entry is:
>
> Entry Score
> ^.{6}$ 255^6