Skip to main content
Finite-state machine

Finite-state machine

Wikipedia

Search complete. 3 mentions across 2 episodes found for "Finite-state machine".

Oct 13, 2026

Unknown podcast

One Regex Rule Worked, One Was Impossible

Oct 13 · 2 Mentions

KornHOST
4:23
Where did this notation come from? 1951.
KornHOST
4:26
A mathematician named Stephen Cole Clean, working at RAND, wrote a memo called Representation of Events in NerveNets and Finite Automata.
KornHOST
4:36
It later became a chapter in a Princeton volume, Automata Studies, in 1956.
KornHOST
4:41
Korn, clean was building on McCulloch and Pitt's work on neural nets.
KornHOST
5:08
Herman, that's the whole notation.
KornHOST
5:10
And those three operations are exactly enough to describe any language a finite automaton can recognize.
KornHOST
5:16
That's the clean theorem, and it's the reason regex and finite automata are the same subject wearing different clothes.
KornHOST
5:23
Corn, 17 years before anybody implemented it.
Life Hacking Tech Brief By HackerNoon

Life Hacking Tech Brief By HackerNoon

500 Blog Posts To Learn About Creativity

Oct 9 · 1 Mention

Artificial IntelligenceNARRATOR
99:34
Trending stories on Hacker Noon today, 378.
Artificial IntelligenceNARRATOR
99:38
THE HACKER NOON Newsletter: The Ethereum Beacon Chain as a State Machine, March 24th, 2026, March 24th, 2026.
Artificial IntelligenceNARRATOR
99:49
Top five stories on the Hacker Noon homepage, 379.
Artificial IntelligenceNARRATOR
99:53
THE TECH BEAT: I Was Sick of the Crypto Off-Ramp Pain.

We value your privacy

We use cookies to understand how you use our platform and to improve your experience. Click “Accept All” to consent, or “Decline non-essential” to opt out of non-essential cookies. Read our Privacy Policy.