Define a set X of numbers as follows.
B. 2 ∈ X.
R1. If x ∈ X, so is 10x.
R2* If x ∈ X, so is x + 4.
List all the elements of X that are less than 30.
The set X of all binary strings (strings with only O's and 1's) having the same number of O's and 1's is defined as follows.
B. λ is in X.
R1. If x is in X, so are 1x0 and Ox1.
R2. If x and y are in X, so is xy.
B. ________is in Y.
R1. If y is in Y, so are _____________ and yx for any
R2 If y and y are in Y so is ___________
Give a recursive definition for the set Y of all binary strings with more O's than 1's.