Solution

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

Let mean all states reachable after reading , allowing arbitrary epsilon transitions before, between, and after its symbols. We prove by mathematical induction on that
For , both sides equal . Suppose the claim holds for , and append . By the definitions of the extended transition functions and the subset construction,
This completes the induction.

New to topics? Read the docs here!