Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/ii/paper-2/4g/a/solution

For a set , let be its epsilon closure, and put
The subset construction with epsilon transitions gives the deterministic finite automaton
Unreachable subsets may be deleted from without changing the recognized language.

New to topics? Read the docs here!