Unverified50% confidenceFactExact time
The finite state automaton (FSA) was formally proposed by mathematician Stephen Kleene in 1956 and is completely equivalent to regular expressions in expressive power.
1
Sources
50%
Confidence
Long-term
Relevance
8/11/2026
First Seen
Sources
Related Claims
Unverified有限状态机的数学基础最早由图灵奖得主 Stephen Kleene 在 1950 年代正式化72% similarUnverified正则表达式的数学根基可追溯至 Stephen Kleene 于1956年提出的正则集合概念，并引入星号表示零次或多次重复72% similarVerifiedThe theoretical foundation of regular expressions comes from the theory of regular languages proposed by mathematician Stephen Kleene in the 1950s.71% similarVerifiedThe theoretical foundation of Finite State Machines (FSM) can be traced back to automata theory from the 1950s.69% similarUnverified库恩-塔克（KKT）条件在1951年将最优性判据推广至非线性情形，构成非线性规划的核心理论基础64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/732508API
curl https://kongchang.com/api/v1/knowledge/claims/732508MCP
get_claim(id=732508)