Let A be the set of all strings of O's and 1's, and let T be the set of all strings of O's and 1's that consist of consecutive triples of identical bits. Consider the coding and decoding functions E and D defined in Example 7.1.9. The encoding function E: A → T is defined as follows. For each string s E A, E(s) = the string obtained from s by replacing each bit of s by the same bit written three times. The decoding function D: T → A is defined as follows. For each string t e T, D(t) = the string obtained from t by replacing each consecutive triple of three identical bits of t by a single copy of that bit. (a) Find E (0110) and D (111111000111). E (0110) D (111111000111) (b) Find E (1010) and D (000000111111). E (1010) D (000000111111)

Q: Find the first three values of the linear congruential generator X; = 2x;–1 +3 (mod 13) starting…

A:

Q: string has at least one 1 and at least one 0. (c) The string contains exactly five 1's or it…

A: The string has at least one 1 and at least one 0. This removes the possibility of all one and all…

Q: Let A = {a, b} and let S be the set of all strings of length 5 over A. Let f: S→ Z be defined as…

A: We are given that          A = {a, b} S is the set of strings over A.  So, strings in S consists of…

Q: What is the cardinality of the set of 2 x 2 matrices over N? Prove your answer.  Note: a 2 x 2…

A:

Q: 3. Let m = 15. Compute (d) for every divisor d of m, and check that Edm (d) = m. Repeat this…

A:

Q: Let Σn denote the set of all binary strings with lengths less than n. For example, Σ2 = {λ, 0, 1}…

A: A function is a mapping from one set to another set. In this case, the function f : Σn → Σn maps a…

Q: For each divisor k>1 of n, let U,(n) = {x E U(n) | x mod k = 1}. [For example, U,(21) = {1,4, 10,…

A: For each divisor k > 1 of n , Uk(n) =x∈U(n)| xmod k =1. To Find: List the elements of U420,U520,…

Q: Let S = {0, 1, 2, 4, 6}. Test the following binary relation on S for reflexivity, symmetry,…

A:

Q: (d)Give the equivalence class of string s = '1010' with respect to the relation R [*1010') =

A: .

Q: Let S be the set of bit strings defined recursively by λ ∈ S and 0x ∈ S, x1 ∈ S if x ∈ S, where λ is…

A:

Q: Let A be the set of all permutations of the 26 letters in the English alphabet. The relation R on A…

A:

Q: Let A={a, b, c, d̟ e, f, g, h, i, j, k, 1, m}. A POSET (A, R) is shown in the Hasse diagram as…

A: a All upper bounds of a,b,c are l,k and m b lower bound of f,g,h doesn't exist. c Longest chain of…

Q: Let f and g be permutations on the set {1, 2, 3, 4, 5, 6, 7}, defined as follows (b) f 1 (c) fgf =…

A:

Q: Let An denote the number of lattice paths from (0,0) to (n, n) that do not pass above the diagonal y…

A: As per the norms, we will be answering the first question. If you need an answer to others, then…

Q: Define a set X recursively as follows. В. 3 and 7 are in X. R. if x and y are in X, so is x + y.…

A:

Q: Given the following recursively defined set S: Basis: 0 € S and 7 E S Recursive rule: if x = S and y…

A:

Q: Let S be the set of all strings in a's and b's, and define C: S → S by C(s) = as, for each s ∈ S.…

A: Let S be the set of all strings in a's and b's. Given that, C:S→S, defined by Cs=as, ∀s∈S To show…

Q: Let A = {1,2,3,4}, and let R be a binary relation on A×A given by: ((a, b), (c, d)) ∈ R if and only…

A:

Q: 8. Let S be a subset of Z defined recursively as follows: • Basis step: 2 e S Recursive step: if k e…

A: Given : base step : 2∈S Recursive step : if k∈S , then : k+5∈Sk-5∈S

Q: EXERCISE 1.13.3: Show an argument with quantified statements is invalid. Show that the given…

A:

Q: Use the congruence c= (3p + 1) mod 26 to encode the message COLOR MONITOR.

A:

Q: Let S be the set of all strings in a's and b's and let L: S- Z be the length function: For all…

A: