Define a string x to be a suffix of y if y can be written as y = zx, where z is

Question

Define a string x to be a suffix of y if y can be written as y = zx, where z is another string. For examples, 01 is suffix of 101 or 1101, but not 100 or 1111. The empty string lambda is a suffix of any string. Now define a binary relation R, on the set of strings over {0, 1} where x R y if and only if x is a suffix of y. Which of the following statements is true? R_3 is a partial order relation. R_3 not a partial order relation because it is not reflexive. R_3 is not a partial order relation because it is not anti-symmetric. R_3 is not a partial order relation because it is not transitive.

Explanation / Answer

The above relation is not a partial order because it is not anti-symmetric.

So,

Answer is C

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.