Design algorithms for testing the following decision properties. Find the worst-case time complexity of both algorithms in O-notation, and discuss (in 1 or 2 lines) how you obtained such a complexity. a) Given a DFA A of a language L, is L empty? The input to the algorithm is A = {Q, E, 8, qo, F}. b) Given two DFAS, A and B, are the languages of A and B equivalent? The inputs to the algorithm are A and B. Hint: Consider the test for equivalence by constructing the product DFA.

For a Turing machine M, (M) refers to the binary representation of M. For a Turing machine M, L(M) contains the set of all strings accepted by M. For a Turing machine M and an input x = {0,1}*, Steps(M, x) refers to the number of steps taken by M to execute on x before it halts. Here, one step of execution of M on x = one movement (left or right) of the tape head. For a Turing machine M and an input x = {0,1}*, we define the following: ReachCells(M,x) = {i : M reaches ith tape cell when M is executed on x} Informally, it contains all locations on the tape that are visited when M is ecuted on x. The leftmost location on the tape is the first tape cell, the location next to it is the second tape cell, and so on. A string w₁ is an anagram of w2 if w₁ can be obtained by rearranging the alphabets of w2. Formally, if w₁ is an n length string, wê is called an anagram of w₁ if there exists a permutation à on n elements such that π(w₁) = W2.

I need help solving 1 and 2

ADJUST Let L (a, ba) be a language over E= (a,b). TRUE or FALSE (with explanation): abab € L. Cancel AUTO ++ Revert