[Mongrel] [OT] Ragel and FSM tutorials
erik.hetzner at ucop.edu
Tue Apr 10 13:00:51 EDT 2007
At Tue, 3 Apr 2007 12:26:13 -0400,
"Jim Hogue" <jjhogue at sbcglobal.net> 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.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Size: 189 bytes
Desc: not available
Url : http://rubyforge.org/pipermail/mongrel-users/attachments/20070410/feccd1b9/attachment.bin
More information about the Mongrel-users