A finite state machine is a graph-like model of some interaction or behaviour, with "states" being nodes on a graph, and "transitions" being edges between nodes.
By constructing a finite state machine of allowed interactions or behaviour, you can apply all kinds of data input to the model, and states change only when their respective criteria is met.
Provided the model is correct, it is then impossible to end up in a programmatically wrong state, that could cause runtime errors.
ID:115722
Jun 28 2011, 9:00 pm
|
|
Jul 11 2011, 8:15 am
|
|
So, this would be good for people who want to create their own "things" during runtime?
|
This would be good for all sorts. AI, conversation routines for Mass Affect etc. style dialogue and so on.
I'm personally incorporating it into a parsing engine. |