Notes / GATE / Theory of Computation

CH 01

Language classes at a glance

Theory of Computation · GATE

Key points

  • Regular ⊂ DCFL ⊂ CFL ⊂ CSL ⊂ Recursive ⊂ RE.
  • Regular languages union, intersection, complement, concatenation, star — closed under all of them.
  • CFLs are not closed under intersection or complement; CFL ∩ Regular = CFL.
  • DCFLs are closed under complement, but not under union/intersection.
  • Recursive languages are closed under complement; RE is not (L and L' both RE ⇒ L recursive).

Formulas & facts

Regular
DFA / NFA / regex
CFL
PDA / CFG
Recursive
Halting TM
RE
TM (accepts)
Done with this chapter? Now put it to use.Today's GATE question →