Sign inSign in

Closure under concatenation

If languages A1 and A2 are regular, their concatenation A1A2 is also regular.
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.

Lecturers

1
  • Michael Sipser

    MIT · Undergraduate

    • 56:06Introduction, Finite Automata, Regular Expressions

Connections

6

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.