The function f binary strings binary strings In each case f

The function f: {binary strings} -> {binary strings}. In each case, find f(S).

a.) S = {000, 1011, 10001}, f(x) = the second bit in x

b.) S = {111, 100, 0111}, f(x) = the binary string that is the sum of the first and last bit

c.) S = {001, 11, 101}, f(x) = the binary string that is equal to x + 1

Solution

a) f(x)={ 0,0,1}

every second bit in the S

b)f(x)={1,1,1}sum of fist and last word

c)f(x)={10,100,0110}

adding 1 to every thing in s