Re: [QUIZ] Perl 'Hard' Quiz of the Week #2005-03-22
Shlomi Fish <shlomif-ik1l9ssToec+JF/[email protected]> Thu, 24 Mar 2005 09:40:20 +0200
| Newsgroups | gmane.comp.lang.perl.qotw.discuss |
|---|---|
| Message-ID | <[email protected]> |
On Thursday 24 March 2005 00:54, Colin Rafferty wrote: > Greg Bacon wrote: > > Shlomi Fish writes: > >> sequence of binary digits (starting from the least significant bit) > > > > Should "least significant" be "most significant," > > I missed that as well. Given that his example automata is written for > "most significant", Actually, the example state machine works for least significant first order. > I assume that the word "least" was a typo, rather > than his example. That is not the case. Regards, Shlomi Fish > > > It's interesting that the resulting automata are isomorphic to one > > another. That they do makes sense after you've seen it, but it wasn't > > an initial expectation. > > I don't see that at all. My solution for MSB-first was pretty > straightforward. In fact, it was by far the shortest solution for a > 'Hard' quiz ever. > > However, I would need an entirely different approach for a LSB-first > problem. I guess that would qualify as a hard quiz. > > We can discuss this more in another 1 day 5 hours 37 seconds (as the > third easy quiz tells me). -- --------------------------------------------------------------------- Shlomi Fish shlomif-ik1l9ssToec+JF/[email protected] Homepage: http://www.shlomifish.org/ Hacker sees bug. Hacker fixes bug.