Theory of computation class!

(3) Let L be the language accepted by the automaton in Figure 2.2. Find a dfa for the language L2 - L1. (4) Let us dene an operation truncate, which removes the rightmost symbol from a ny string. For ple, truncate (aaaba) is aaab. The operation can be extended to languages by truncate(L) {truncate(w) : w e L} Show how, given a dfa for any regular language L, one can construct a dfa for truncate (L). From exam this, p rove that if L is a regular language not containing , then truncate (L) is also regular. (3) Let L be the language accepted by the automaton in Figure 2.2. Find a dfa for the language L2 - L1. (4) Let us dene an operation truncate, which removes the rightmost symbol from a ny string. For ple, truncate (aaaba) is aaab. The operation can be extended to languages by truncate(L) {truncate(w) : w e L} Show how, given a dfa for any regular language L, one can construct a dfa for truncate (L). From exam this, p rove that if L is a regular language not containing , then truncate (L) is also regular