Verified65% confidenceFactTime unknown
The theoretical foundation of regular expressions comes from the theory of regular languages proposed by mathematician Stephen Kleene in the 1950s.
3
Sources
65%
Confidence
Long-term
Relevance
5/31/2026
First Seen
Sources
Related Entities
Related Claims
Unverified有限状态机的数学基础最早由图灵奖得主 Stephen Kleene 在 1950 年代正式化76% similarUnverifiedThe finite state automaton (FSA) was formally proposed by mathematician Stephen Kleene in 1956 and is completely equivalent to regular expressions in expressive power.71% similarUnverified1957年诺姆·乔姆斯基发表《句法结构》，用形式文法理论重新定义了语言的计算性描述71% similarUnverified正则表达式的数学根基可追溯至 Stephen Kleene 于1956年提出的正则集合概念，并引入星号表示零次或多次重复68% similarUnverifiedThe concept of "Comprehensible Input" comes from the Input Hypothesis proposed by linguist Stephen Krashen in the 1980s.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/4607API
curl https://kongchang.com/api/v1/knowledge/claims/4607MCP
get_claim(id=4607)