Sign inSign in

Nondeterministic finite automaton

A new kind of finite automaton that allows multiple paths of computation, including transitions on the empty string.
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.

Deterministic finite automata1Deterministic finite automaton (DFA)1Finite automata1Nondeterminism1Power set1States and transitions1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Lectures that assume it

    1

    Connections

    7

    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.