1. Examine the following DFA This DFA accepts a certain language L. In this problem we shall consider certain other languages that are defined by their tails, that is, languages of the form (0+1) *w, for some particular string w of 0’s and 1’s. Call this language L(w) Depending on w, L(w) may be contained in L, disjoint from L, or neither contained nor disjoint from L (i.e., some strings of the form rw are in
OR
OR