Solved

Let SS Be the Set of All Strings in 0 'S and 'S

Question 16

Essay

Let SS be the set of all strings in 0 's and 1's, and define a function g:SZg : S \longrightarrow \mathbf { Z } as follows: for each string ss in SS ,
g(s)= the number of 0 ’s in s.g ( s ) = \text { the number of } 0 \text { 's in } s .
(a) What is g(101011)g ( 101011 ) ? g(00100)g ( 00100 ) ?
(b) Is gg one-to-one? Prove or give a counterexample.
(c) Is gg onto? Prove or give a counterexample.

Correct Answer:

verifed

Verified

a. blured image
b. blured image is not one-to-one.
blured image blured image and blured image but blured image.
...

View Answer

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Unlock this Answer For Free Now!

View this answer and more for free by performing one of the following actions

qr-code

Scan the QR code to install the App and get 2 free unlocks

upload documents

Unlock quizzes for free by uploading documents