indicate which language it generates. $($This is sort of like matching, except that answers may be used more than once, or not

$$All strings of O$\text{'}$s and $1\text{'}$s with the same number of O$\text{'}$s as of $1\text{'}$s$.$

$$All strings of O$\text{'}$s and $1\text{'}$s with at least as many O$\text{'}$s as $1\text{'}$s$.$

$$All strings of $0\text{'}$s and $1\text{'}$s that are palindromes.

$$All strings of O$\text{'}$s and $1\text{'}$s that are not palindromes.

$$Strings of the form $0\text{'}1$ where i and j are integers and i $>=$ j$.$

$$Strings of the form $0\text{'}1$ where i and j are integers and i $<=$ j$.$

$$Strings of the form $0\text{'}1$ where i and j are integers and i and j are not equal.

V

$$X $0$X$1/1$X$0|$ XX $/0|$ E

$$X $0$X$0/1$X$1/0$Y$1/1$YO

Y $$ OY $/1$Y $|$ E