O'Reilly Tags

We're experimenting with a folksonomy based on tag data provided by Follow development in this blog post.

Building a Finite State Machine Using DFA::Simple (2 tags)
A finite state machine (FSM) is a general-purpose mechanism for solving common programming problems that involve performing actions based on previous and current input. (They're good for parsers and the like.) William Ruppert demonstrates how to build and use FSMs in Perl.