Lecture note Theory of automata - Lecture 19

The following will be discussed in this chapter: NFA corresponding to closure of FA, examples, memory required to recognize a language, example, distinguishing one string from another, example, theorem, proof.