True/False: a) There exists a mapping reduction from ETM to EDFA. b) There exists a mapping reduction from ATM to ETM. c) There exists a mapping reduction from ECFG to EQTM

Select the following relations on Z that are reflexive. {(a, b) | ab >0} {(a, b) | a>b-1} {(a,b) a² > b} 2 {(a,b) | a² = b² (mod 7)}

WRITE CFG TO CNF(Chomsky Normal Form) ?

Fill out the dynamic programming table for the global alignment between sequences v = TAGCTCCG and w = GCATCCA

(1) Please show that each of the followings is not  a valid rule about FD’s by giving a counter example. (Note that you are allowed to use only (a and b) two symbols to construct your tuples.) (a) If AB→C and A→C, then B→C. (b) If AB→C, then A→C or B→C. (database)

Question 2) form. Show all your work STEP by STEP. Explain the steps and apply the required changes until the normal form is achieved. Convert the following CFG to an equivalent CFG in Chomsky normal S→ AB JABC |aS A → aA E > bB C cC c В C

Describe the advantages of the first normal form (1NF) and the conditions that must be met to achieve it.

Keep in mind that this DFA's complement may be found by switching its accept and non-accept states. Justify the possibility of using this method to make a TM's mate. Do you have any idea how to go about creating a supplement to a TM? If so, could you elaborate? What would prevent you from doing so, if anything?

Create a dfa for the regular grammer:   S → abS|A A → baB B → aA|bb.

Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}, S = {(0, 0), (0, 2), (0, 3), (2, 3)}, T = {(0, 1), (2, 3)}. a. Is R reflexive? symmetric? transitive? b. Is S reflexive? symmetric? transitive? c. Is T reflexive? symmetric? transitive?