Kleene's theorem
English
editEtymology
editNamed after mathematician Stephen Cole Kleene.
Proper noun
edit- (computing theory) A theorem stating that regular expressions are equivalent to finite-state machines.
Named after mathematician Stephen Cole Kleene.