Computer Science In function f(x) ->y the domain of x is continuous in the range 1-10 how many equivalence classes are there in this case?

Select the function f that is an isomorphism from G to G'. b 3 5 d 2 G G' f(a) = 3, f(b) = 5, f(c) = 4, f(d) = 2, f(e) = 1 %3D %3D f(a) = 3, f(b) = 5, f(c) = 2, f(d) = 4, f(e) = 3 f(a) = 3, f(b) = 4, f(c) = 2, f(d) = 5, f(e) = 1 O fla) = 3, f(b) = 5, f(c) = 2, f(d) = 4, f(e) = 1

Assignment 6: Problem Set on TMs. 1. Given the following definition of a Turing machine M = (Q, E, I, 6, 91, accept, Greject): • Q={91, 92, 98, Jaccept, greject} « Σ = {0, 1, #} • T = EU {z, u} 0-0, R 1-1,R ## .R 0-2,R 9 0-2, L 9: 97 0-0, L 1-1, L #-#.R 1-2, R 9s 3. Prove that every regular language is decidable. ##.R 9 1-3, L 0-0, R 1-1, R 0-0, L 1-1,4 z-z, R Simulate the Turing machine on input (a) 010#1 and (b) 1#1. Use the concept of configurations to illustrate the transitions. z-z.R Garape Note: To simplify the figure, the reject state and transitions going to the reject state are not shown. Those transitions occur implicitly whenever a state lacks an outgoing transition for a particular symbol. R 2. Let A be the set of all strings over the alphabet (a, b) where the number of a's is twice as much as the number of b's. Construct the state diagram of a Turing machine that recognizes A.

Show that the following language is decidable by giving a high-level description of a decider M with L(M) = L. L = {(A)|A is a DFA over 2* and L(A) = E* }