Toc

Theory of Computation

Table of Contents

• Theory of Computation
• Automata
  • Deterministinc
  • Finite
  • Non-Detereministic Finite
• Decision Problems (H)
  • P (Polynomial Time)
  • NP (Non-Deterministic Polynomial Time)
  • NP-Complete
  • NP-Hard

Automata

Deterministinc

Finite

Non-Detereministic Finite

Decision Problems (H)

P (Polynomial Time)

NP (Non-Deterministic Polynomial Time)

NP-Complete

NP-Hard