Answered: Let S be the set of all strings over…

Let S be the set of all strings over the alphabet {0,1}. Define D: S→Z as: D(s) = the number of 1's in s minus the number of 0's in s. Prove if D one-to-one and/or onto.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

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
Q. 7. Is the power set P(H), which is the set of all subset of H {1,2} with the operations of and a Boolean algebra? Justify your answer. Here the operations and "on P(H) are defined by: C*D=(CUD)-(CnD), and C"D-(CND), for all C,De P(H). Here U and n represent union and intersection, respectively.
5. Let S be the set of all finite strings of a's and b's. . Define f : S → Z as follows: For each string s in S, the number of a's in s if s begins with an a f(s): f(s) = the number of b’s in s if s begins with a b O if s = €, that is, if s is the empty word Find the following: (a) f(aba) = (b) f(bbab): (c) What is the range of f? Explain.
Denote by Z, the set of nonnegative integers. Let Rbe the relation on A = R defined by x Ry if x – y is a nonnegative integer, i.e., there exists some n E Z, such that x – y = n. 1. Show that R is a partial order on R. 2. Let B = {2,4} and C = {V2, 4}. Find sup(B). Explain. Does C have an upper bound? Explain. 3. Is Ra total order on R? If yes, explain. If no, given an example why not.
Let S be the set of all students at FIU. Determine whether the relation R on S (defined below) is reflexive, irreflexive, symmetric, antisymmetric and transitive? Support your answer with a proof or a counterexample per each property. R = {(x, y) = SxSx has a better GPA than y} alternatively, we can write Ry if student x has a better GPA than student y
Let F and G be event spaces over 2. Show that FNG is also an event space over 2.
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
4. Consider the set of all strings of a's, b's, c's and d's. (a) Make a list of all of these strings of length zero, one, and two that do not contain the pattern bb. (b) For each integer n > 0, let sn = the number of strings of a's, b's, c's and d's of length n that do not contain the pattern bb. Find so, s1, and s2. (c) Find a recurrence relation for the sequence s0, S1, S2, . ..
Let A={x,y} and let S be the set of all strings over A . Define a relationC from S to S as follows: For all strings s and t in S , (s,t)∈Cmeans thatt=ys⁢.Then C is a function because every string in S consists entirely of x ’s andy ’s and adding an additional y on the left creates a single new string that consists of x ’s and y ’s and is, therefore, also in S . Find C(x) andC(yyxyx) .
6. if x C y. (a) (b) Let R = {a: a is a cut}.Let x, y, R. We say that a