Let S be the set of all strings in a's and b's, and define C: S - Sby C(s) = as, for each s ES. (C is called concatenation by a on the left.) (a) Is C one-to-one? To answer this question, suppose s, and s, are strings in S such that C(s,) = C(s,). Use the definition of C to write this equation in terms of a, s,, and s, as follows. as, = Now strings are finite sequences of characters, and since the strings on both sides of the above equation are equal, for each integer n2 0, the nth character from the left in the left-hand string equals the nth character from the left Vy in the right-hand string. the nth character from the left It follows that for each integer n 2 0, the nth character from the left ins, equals S,. Hence, s, = V S, and so C is in one-to-one. (b) Show that C is not onto. Counterexample: The string is in S but is not equal to C(s) for any v string s because every string in the range of C starts with

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Let S be the set of all strings in a's and b's, and define C: S - Sby
C(s) = as, for each s ES.
(C is called concatenation by a on the left.)
(a) Is C one-to-one?
To answer this question, suppose s, and s, are strings in S such that C(s,) = C(s,). Use the definition of C to write this equation in
terms of a, s,, and s, as follows.
as, =
Now strings are finite sequences of characters, and since the strings on both sides of the above equation are equal, for each integer n 2 0, the
nth character from the left in the left-hand string equals
It follows that for each integer n 2 0, the nth character from the left ins, equals
S3. Hence, s, = v S, and so c is
the nth character from the left
Vy in the right-hand string.
the nth character from the left
in
one-to-one.
(b) Show that C is not onto.
Counterexample: The string
is in S but is not equal to C(s) for any
string s because
every string in the range of C starts
with
Transcribed Image Text:Let S be the set of all strings in a's and b's, and define C: S - Sby C(s) = as, for each s ES. (C is called concatenation by a on the left.) (a) Is C one-to-one? To answer this question, suppose s, and s, are strings in S such that C(s,) = C(s,). Use the definition of C to write this equation in terms of a, s,, and s, as follows. as, = Now strings are finite sequences of characters, and since the strings on both sides of the above equation are equal, for each integer n 2 0, the nth character from the left in the left-hand string equals It follows that for each integer n 2 0, the nth character from the left ins, equals S3. Hence, s, = v S, and so c is the nth character from the left Vy in the right-hand string. the nth character from the left in one-to-one. (b) Show that C is not onto. Counterexample: The string is in S but is not equal to C(s) for any string s because every string in the range of C starts with
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,