Define a relation R on the set of all bit strings: w1 R w2 if lenght (w1) < leng

Question

Define a relation R on the set of all bit strings: w1 R w2 if lenght (w1) < lenght (w2) for all bit strings w1,w2.
Ex: 110 R 0010 since L(110) < L(0010) where L(x) is length of string x.

Determine if each property holds. Support your result with a proof or counterexample.

yes/no proof/counterexample

a) Reflexive
----- -----------------------------

b) Irreflexive
----- -----------------------------

c) Symmetric
----- ---------------------------------

d) Antisymmetric
----- ---------------------------------

e) Transitive
----- ----------------------------------

Explanation / Answer

Please rate ASAP, I uploaded ur answer here _ https://dl.dropbox.com/u/83216089/asol/Patriot30.relation.gif

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

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