Question 11. (a) Write a recursive definition for the set S of all non-empty bitstrings, which are non-empty strings of
Posted: Thu Jul 14, 2022 2:06 pm
need solution
Question 11. (a) Write a recursive definition for the set S of all non-empty bitstrings, which are non-empty strings of 0 's and 1 's. Hint: You'll need two base cases since the smallest bitstrings are 0 and 1 . (b) Write a recursive definition for the length l(s) of a non-empty bitstring. Define length as the number of bits in the string.
Question 11. (a) Write a recursive definition for the set S of all non-empty bitstrings, which are non-empty strings of 0 's and 1 's. Hint: You'll need two base cases since the smallest bitstrings are 0 and 1 . (b) Write a recursive definition for the length l(s) of a non-empty bitstring. Define length as the number of bits in the string.