There is a three questions:

Use Doty's Automaton Simulator at https://web.cs.ucdavis.edu/-doty/automata/ to complete this exercise 3. Construct a DFA or NFA that recognizes the language {w {0,1}* | w contains at exactly three 0's). 1 Theory of Computation: Problems 4. For any string w = wiW2 ... Wn, the reverse of w, written w, is the string w in reverse order, Wn - W2w1. For any language A, let AR = {WR | W E A}. Show that if A is regular, so is AR. 5. For any language A, let AS = {ycy *, ry e A}, where is the alphabet of the language. Informally, AS is the set of all strings that are a suffix of a string in A. Show that if A is regular then AS is regular