# FA18:Lecture 27 Kleene's theorem (RE to NFA)

From CS2800 wiki

We prove that Claim:Every regular language is NFA recognizable.

- Last semester
- File:Lec27-board.pdf (these are actually taken from last semester, but they are much cleaner than this semester's due to the tablet malfunction).