develooper Front page | perl.fwp | Postings from March 2005

Re: Self-recognizing programs and regular expressions

Thread Previous | Thread Next
From:
Josh Goldberg
Date:
March 8, 2005 14:08
Subject:
Re: Self-recognizing programs and regular expressions
Message ID:
31097b0b988bcd818f349cf694309d41@3io.com
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


Thread Previous | Thread Next


nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About