FA18:Lecture 22 Automata constructions

From CS2800 wiki

We finished the proof of correctness started last lecture, by strengthening the inductive hypothesis. We constructed an automata to recognize the union of two recognizable languages.