Decidability Table in Theory of Computation

Prerequisite - Undecidability, Decidable and undecidable problems 
Identifying languages (or problems*) as decidable, undecidable or partially decidable is a very common question in GATE. With correct knowledge and ample experience, this question becomes very easy to solve. 

A language is undecidable if it is not decidable. An undecidable language maybe a partially decidable language or something else but not decidable. If a language is not even partially decidable , then there exists no Turing machine for that language. 

In this topic you will see Decidability table and shortcut to learn them. 

Intersection of 2 recursively enumerable languages is recursively enumerable, so it is decidable.

In the above table, 

'RL' implies Regular language.
'CFL' implies Context free language.
'DCFL' implies deterministic context free language.
'CSL' implies Context sensitive language.
'REC.L' implies Recursive language.
'REL' implies Recursive enumerable language.
'D' implies that the problem is decidable.
'UD' implies that the problem is undecidable.

Note: 

1. Regular language: It Decidable for all problems.
2. CFL: It is decidable for emptiness problem, finiteness problem, and membership problem.
3. CSL and REC.L: Both are decidable for membership problem, Is complement of 'L' a language of same type or not?, and (Is intersection of two languages of same type or not?.
4. REL: It is decidable for (Is intersection of two languages of same type or not?)
5. DCFL It is decidable for everything decidable in CFL plus (Is complement of 'L' a language of same type or not?), (Is 'L' regular language?).

nidhi1352singh

Follow

Improve

Article Tags :

• GATE CS
• Theory of Computation