Decision Properties of Languages

I'd trouble remembering decision properties of languages like Regular, CFL, RE, etc. So I made a table of it. Are all the entries of table correct or has some errors

http://postimg.org/image/bdb5tqkfl/][/PLAIN] [Broken]
http://s24.postimg.org/bdb5tqkfl/Decision_Property.jpg

 

Here
RL=Regular Languages
DCFL=Deterministic Context Free Languages
CFL=Context Free Languages
CSL=Context Sensitive Languages
RE=Recursively Enumerable Languages

##1^{st}## Column "Membership" corresponding to a particular row says that, is it decidable that a given string belong to a given language.

##2^{nd}## Column "##L=\phi##" corresponding to a particular row says that, is it decidable that a given language empty or not "i.e Emptiness Test".

##3^{rd}## Column "##L=\sum##*" corresponding to a particular row says that, is it decidable that a given language infinite.

##4^{th}## Column "Is ##L_1=L_2##" corresponding to a particular row says that, is it decidable that a given languages ##L_1, L_2## are equal.

##5^{th}## Column "Is ##L_1 \subset L_2##" corresponding to a particular row says, is it decidable that a given language ##L_1## a subset of another given language ##L_2##.