Home Courses Theory of Computation Course materials Lectures 1: Preliminaries – Automata and Languages

1: Preliminaries – Automata and Languages

Course week(s) Week 1
Course subject(s) 1: Preliminaries – Automata and Languages

Description: This module captures some important preliminaries to the course. These include the notions of deterministic and non-deterministic finite state automata, regular languages, grammars, context-free grammars, context-free languages and Chomsky normal form.

Book: Introduction to the Theory of Computation, parts of chapters 1 and 2.

Key Concepts:

  • Finite State Automata
  • Determiinistic Finite State Automata
  • Regular Languages
  • Nondeterministic Finite State Automata
  • Closure Property
  • Grammars
  • Context-free Grammars
  • Context-free Languages
  • Chomsky Normal Form
Module 1
Creative Commons License
Theory of Computation by TU Delft OpenCourseWare is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Based on a work at https://ocw.tudelft.nl/courses/theory-of-computation/.
Back to top