Verified65% confidenceFactExact time
The theoretical foundation of Finite State Machines (FSM) can be traced back to automata theory from the 1950s.
3
Sources
65%
Confidence
Long-term
Relevance
7/6/2026
First Seen
Sources
Godot Game AI Development: Building Autonomous NPC Planning with GOAP
bilibili迷谷刘7/4/2026
Related Claims
Unverified有限状态机的理论基础由沃伦·麦卡洛克和沃尔特·皮茨在1943年的神经网络研究中奠定，后经摩尔和米利在20世纪50年代形式化为完整的自动机理论75% similarUnverifiedThe theoretical foundation of finite state machines (FSMs) was laid by mathematicians Warren McCulloch and Walter Pitts in their 1943 research on neural networks.74% similarUnverified状态空间模型（SSM）的数学根基可追溯至卡尔曼滤波（1960年）和线性时不变系统理论71% similarUnverifiedThe finite state automaton (FSA) was formally proposed by mathematician Stephen Kleene in 1956 and is completely equivalent to regular expressions in expressive power.69% similarUnverifiedA hierarchical state machine (HSM) is an extension of the FSM, originating from the Statecharts theory proposed by David Harel in 1987 and later becoming the theoretical basis of UML state diagrams, and it allows a state to nest sub-state machines within it.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/115078API
curl https://kongchang.com/api/v1/knowledge/claims/115078MCP
get_claim(id=115078)