I. Regular language is given by regular expression = (b (a Uc)) (aub) under the alphabet A = {a, b, c}. a) Construct 3-vertex source corresponding to C b) Construct regular source for C c) Construct deterministic source for C; d) Construct deterministic source for the language II. Finite automaton is given by canonical equations (under the binary alphabet A = {0,1}). Represent it in the forms of canonical table, Moore diagram and circuit. y(t) = (x(t) & q (t1)) 92(t1), t1 91(t) = q(t-1) V q2 (t-1), 92(t) qi(t-1)x(t), t1 t1 91 (0) = 1, 92(0)= 0. III. Deterministic function f: {0,1} - {0,1} is given, Prove that f is restrictely deterministic, enumerate all its residue functions and find its weight. Construct equivalence classes for the set of all (0,1)-words under the system of residue functions. Construct finite automaton realizing the function in the form of Moore diagram. f(x1...In) = 11, 12, 13, 12 14,..., In-2-