decidability

Question

please someone explain what are these problems and how to solve these problems for every language with proper explanation?

1. MEMBERSHIP PROBLEM
2. EMPTINESS PROBLEM
3. COMPLETENESS PROBLEM
4. EQUILITY PROBLEM
5. SUBSET PROBLEM
6. DISJOINTNESS PROBLEM
7. IS GIVEN LANGUAGE REGULAR 
8. FINITENESS PROBLEM

Comments

@Rahul_Rathod_

https://gatecse.in/rices-theorem/

---

equivalence of 2 DCFL is decidable but your table saying it is UD

---

In 1997, Géraud Sénizergues proved that equivalence of DCFLs is decidable, and he was awarded the Gödel Prize for it.