Sign inSign in

Regular language

A language is a regular language if some finite automaton recognizes it.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Finite automaton2Language1Language recognition1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Michael Sipser

    MIT · Undergraduate

    • 0:56CF Pumping Lemma, Turing Machines

Lectures that assume it

2

Connections

11

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.