Strengths of finite state machines

The straightforwardness of a state machine relies heavily on large amounts of data. One of the key strengths with such a structure lies in the fact that the statefulness of an agent is inherent within the logical structure.

Compared to a decision tree, finite states isolate the amount of possible actions that can follow from another action. To create the same sort of flow in a decision tree would be inherently difficult and would require embedding some sort of userdata that maintains the statefulness we get for free with a finite state machine.