Let S be the set of all string of 0’s and 1’s, and define by
Whether L is one-to-one or not.
Consider be the set of all strings of .
is defined by, the length of , for all strings .
In one-to-one function, distinct elements in domain are mapped with distinct elements in codomain.
Objective is to determine that is one-to-one or not.
Claim: is not one-to-one
Whether L is onto or not.
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started