It's ok, I also posted the problem on comp.programming, and I got a lot
of feedback there. Thanks anyway.
How about the language consisting of all the odd numbers. The binary of all odd numbers would be
(0+1)*1, which is regular. I don't think, in base 3, you could
represent it in a regular _expression_. I am not good at proofs - maybe
you can try and get it.
enjoy madi
mayurOn 1/17/06, pramod [EMAIL
On 1/17/06, Lenin Ravindranath S [EMAIL PROTECTED] wrote:
CodeAreana - Online Programming Contest - January 29th 2006
[from the Rules page]
Participants will be first ranked by the number of problems correctly
solved.
[it's ok ...]
In case of a tie, the participants shall be in turn ranked
