Question: 2. (10 points) Consider the function from {0, 1} to {a, b} given by h(0) = a, h(1) = ab. We can extend h to
2. (10 points) Consider the function from {0, 1} to {a, b} given by h(0) = a, h(1) = ab. We can extend h to operate on strings by defining h(w) = h(w1)h(w2) h(wn) where w = w1 wn and each wi {0, 1}. For example, h(010) = aaba. Extending h to languages over {0, 1}, we define h(L) = {h(w) | w L} for any L {0, 1} . Devise a general construction that, given a DFA M over the alphabet {0, 1}, builds a (DFA or NFA) M0 over the alphabet {a, b} that recognizes h(L(M)). A full proof would have three stages: setup, construction, and proof of correctness. In this exercise you will focus on the setup and construction, and then apply your construction to an example. Setup Consider an arbitrary DFA M = (Q, {0, 1}, , q0, F), and call the language of this DFA L. Construction Build a new (DFA or NFA) whose language is h(L). Application Consider the language, L, recognized by this DFA (from a previous homework):
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
