Sign inSign in

NFA construction for union

Constructing a new NFA MM that accepts the union of two languages by adding a new start state with ϵ\epsilon-transitions to the start states of the DFAs recognizing those languages.
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.

ϵ\epsilon transition1Deterministic finite automata (DFA)1Nondeterministic finite automata (NFA)1

Lecturers

1

    Connections

    2

    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.