How to remember decidability?

Question

I want to know how to remember which language is decidable for which property. Should I go through the proofs or should I remember everything?

Comments

peter linz or ullman used it atleast read 3 times evry statmnt then try to understand the meaning ..

http://www.gatecse.in/category/preparation/subjects/theory-of-computation/ use this link and ask here if any doubt in any proof.

---

Thank a lot

---

any time. :)

Answer 1

Using my MeFinE Rule:

Comments

Thanks for this, this is very helpful

Answer 2

I think u make a list of the all problem and corresponding language under which it will decidable and undecidable.

For example regular laguge always decidable in each and every types of problem where as Recursive enumerable language never.

Similrly u search for CFL,DCFL,CSL as well as RL and corresponding problem.