Question 10 (10 points) Let = {x,y} be an alphabet. A. Let L1 be the language consisting of all strings over that begin

[answerhappygod]

Question 10 10 Points Let X Y Be An Alphabet A Let L1 Be The Language Consisting Of All Strings Over That Begin 1 (84.29 KiB) Viewed 26 times

Question 10 (10 points) Let = {x,y} be an alphabet. A. Let L1 be the language consisting of all strings over that begin with an x and have length <= 3. List the elements of L1 between braces. B. Let L2 be the language consisting of all strings over of length <=3 in which all the x's appear to the left of all the y's. List the elements of L2 between braces A/ Question 11 (8 points) For each binary relations defined on the set A = {0,1,2,3) 1. determine whether the relation is reflexive; 2. determine whether is relation is symmetric; 3. determine whether is relation is transitive; R = {(0,1),(1,2), (0, 2)}; S = {(2,3), (3,2) R-transitive, symmetric, reflexive S - not symmetric, not reflexive, not transitive R-transitive, not symmetric, not reflexive S - symmetric, not reflexive, not transitive R- not transitive, not symmetric, not reflexive S - not symmetric, not reflexive, not transitive S-transitive, not symmetric, not reflexive R - symmetric, not reflexive, not transitive