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

From CS2800 wiki

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