Let S be the set of all strings in a’s and b’s, and define
Chapter 7, Problem 25E(choose chapter or problem)
Problem 25E
Let S be the set of all strings in a’s and b’s, and define C: S → S by C(s) = as, for all s ∈ S.
(C is called concatenation by a on the left.)
a. Is C one-to-one? Prove or give a counterexample.
b. Is C onto? Prove or give a counterexample.
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