Level 16 · Module 57

Theory of Computation

A structured module covering the essential ideas of theory of computation.

Difficulty
advanced
Published path
8 lessons · 80 min

What you will learn

  • Formal languages
  • Regular languages
  • Finite automata
  • Context-free grammars
  • Pushdown automata
  • Turing machines
  • Computability
  • Decidability
Prerequisites:Scalability

Start here

Lessons · 80 min

  1. Formal languagesPlanned

    Planned lesson: Formal languages. This lesson has not been written yet.

    10 min · advanced
  2. Regular languagesPlanned

    Planned lesson: Regular languages. This lesson has not been written yet.

    10 min · advanced
  3. Finite automataPlanned

    Planned lesson: Finite automata. This lesson has not been written yet.

    10 min · advanced
  4. Context-free grammarsPlanned

    Planned lesson: Context-free grammars. This lesson has not been written yet.

    10 min · advanced
  5. Pushdown automataPlanned

    Planned lesson: Pushdown automata. This lesson has not been written yet.

    10 min · advanced
  6. Turing machinesPlanned

    Planned lesson: Turing machines. This lesson has not been written yet.

    10 min · advanced
  7. ComputabilityPlanned

    Planned lesson: Computability. This lesson has not been written yet.

    10 min · advanced
  8. DecidabilityPlanned

    Planned lesson: Decidability. This lesson has not been written yet.

    10 min · advanced

What you will cover

Module units

  1. Formal languages

    A planned unit covering Formal languages.

  2. Regular languages

    A planned unit covering Regular languages.

  3. Finite automata

    A planned unit covering Finite automata.

  4. Context-free grammars

    A planned unit covering Context-free grammars.

  5. Pushdown automata

    A planned unit covering Pushdown automata.

  6. Turing machines

    A planned unit covering Turing machines.

  7. Computability

    A planned unit covering Computability.

  8. Decidability

    A planned unit covering Decidability.