Kleene's theorem
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after mathematician Stephen Cole Kleene.
Proper noun[edit]
- (computing theory) A theorem stating that regular expressions are equivalent to finite-state machines.