At Tue, 3 Apr 2007 12:26:13 -0400, "Jim Hogue" <[EMAIL PROTECTED]> wrote: > > (Off topic, but just in case others are interested :-). > > You should probably take a look at some computer science college level > theory books. Look for "Automata Theory", "Turing machines", > "deterministic finite automation", and "non-deterministic finite > automation". The turning machine is the classic example.
[…] Just to clarify, a Turing machine is not a finite automata but a more powerful kind of theoretical device. But this really isn’t the place. Start here <http://en.wikipedia.org/wiki/Finite_state_machine>, skip the formal definition at first, understand how a FSM can recognize regular languages, and you’re on your way. The Sipser book referenced is pretty good, in my opinion. best, Erik
pgpYVF4ifuckz.pgp
Description: PGP signature
_______________________________________________ Mongrel-users mailing list [email protected] http://rubyforge.org/mailman/listinfo/mongrel-users
