Let S be the set of all strings in as and bs, and define C: S S by C(s) = as, for all s

Chapter 7, Problem 25

(choose chapter or problem)

Let S be the set of all strings in a’s and b’s, and define C: \(S \rightarrow S\) by

C(s) = as, for all \(s \in 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.

Text Transcription:

S rightarrow S

s in S