a) Give a recursive definition of the function
Chapter 5, Problem 32E(choose chapter or problem)
Problem 32E
a) Give a recursive definition of the function ones(s),which counts the number of ones in a bit string s.
b) Use structural induction to prove that ones(st) = ones(s) + ones(t).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer