let 5 be the set at all strings in a's and b's, and define C: S 5by (Cis called ca:alenalian by a un the le ) (a) Prove that Cis one to one. Proof: Suppose s, and sz are strings In 3 such thet Cts) - Cts). Use the definldon of C'to write this ceuetdon in terms of a, 5, and s, as fullows: Now strings are finite socuences ot characters, and since the strings on bath sidcs at the above equation are equal, tor cach Intogarn2 0, the nth character trom the ict in tihe latt-hand string ---Seect- - the oth character trom the let in the nght-hand strina. It follows that for cach Integer n0, the oth character from the let in s, oquals thc nth character from the let In s.. Hence s, - 5, and so C: one-to-cne. (b) Give a oaunterexample to show that C is not onta. Counterexample: The strina k in 5 but is not ecual to Cs) tor any string s harausa evary string in the range at 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 5 be the set at all strings in a's and b's, and define C: S 5by
(Cis called ca:alenalian by a un the le )
(a) Prove that Cis one to one.
Proof: Suppose s, and sz are strings In 3 such thet Cts) - Cts). Use the definldon of C'to write this ceuetdon in terms of a, 5, and s, as fullows:
Now strings are finite socuences ot characters, and since the strings on bath sidcs at the above equation are equal, tor cach Intogarn2 0, the nth character trom the ict in tihe latt-hand string ---Seect-
- the oth character trom the let in the
nght-hand strina. It follows that for cach Integer n0, the oth character from the let in s, oquals thc nth character from the let In s.. Hence s, - 5, and so C: one-to-cne.
(b) Give a oaunterexample to show that C is not onta.
Counterexample: The strina
k in 5 but is not ecual to Cs) tor any string s harausa evary string in the range at C starts with
Transcribed Image Text:let 5 be the set at all strings in a's and b's, and define C: S 5by (Cis called ca:alenalian by a un the le ) (a) Prove that Cis one to one. Proof: Suppose s, and sz are strings In 3 such thet Cts) - Cts). Use the definldon of C'to write this ceuetdon in terms of a, 5, and s, as fullows: Now strings are finite socuences ot characters, and since the strings on bath sidcs at the above equation are equal, tor cach Intogarn2 0, the nth character trom the ict in tihe latt-hand string ---Seect- - the oth character trom the let in the nght-hand strina. It follows that for cach Integer n0, the oth character from the let in s, oquals thc nth character from the let In s.. Hence s, - 5, and so C: one-to-cne. (b) Give a oaunterexample to show that C is not onta. Counterexample: The strina k in 5 but is not ecual to Cs) tor any string s harausa evary string in the range at C starts with
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Finite State Machine
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
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,