theory of computation
6. Using adders, subtractors, comparers, copiers, multipliers or find length functions, draw a block diagram Turing machine that computes the function: F (WI, W2, W)-i, where i is the index of the shortest string of wi, W2 and w3, if all the lengths are distinct and 0 if at least two strings have the same length. Assume that wi, wz and ws E For example F ( 1 1 1 1 , 1, 1 1
OR
OR