1 This class implements a simple state machine pattern, allowing you to
2 quickly build rules-based state machines in Perl. As a simple
3 implementation of a powerful concept, it differs slightly from an ideal
4 DFA model in that it does not enforce a single possible switch from one
5 state to another. Rather, it short circuits the evaluation of the rules
6 for such switches, so that the first rule to return a true value will
7 trigger its switch and no other switch rules will be checked. (But see the
8 strict attribute and parameter to new().) It differs from an NFA model in
9 that it offers no back-tracking. But in truth, you can use it to build a
10 state machine that adheres to either model--hence the more generic FSA
13 WWW: http://search.cpan.org/dist/FSA-Rules/