Solved: Let S be the set of all strings of English

Chapter 8, Problem 8.1

(choose chapter or problem)

Let S be the set of all strings of English letters. Determine whether these relations are reflexive, irreflexive, symmetric, antisymmetric, and/or transitive. a) RI = {(a, b) I a and b have no letters in common} b) R2 = {(a , b) I a and b are not the same length} c) R3 = {(a , b) I a is longer than b}