FA18:Lecture 27 Kleene's theorem (RE to NFA)
From CS2800 wiki
We prove that
Claim:Every regular language is NFA recognizable
(these are actually taken from last semester, but they are much cleaner than this semester's due to the tablet malfunction).
Retrieved from "
What links here
This page was last edited on 1 November 2018, at 14:43.
About CS2800 wiki