6 ms·
Behavior trees can be fully implemented in this language, and are a (fairly limited) subset of finite state machines
by JohnHaugeland 6y ago
Behavior trees can be fully implemented in this language, and are a (fairly limited) subset of finite state machines
- Datenstrom 6y agoI do not believe that is true. Pure FSMs are not Turing complete[1] while behavior trees can be made trivially so. BTs are not isomorphic to FSMs. I am not aware of any system that can be modeled in an FSM and not in a behavior tree. [1]: https://www.aaai.org/Papers/AIIDE/2008/AIIDE08-006.pdf https://www.aaai.org/Papers/AIIDE/2008/AIIDE08-006.pdf