Sign inSign in

Acceptance problem for NFAs

The language ANFAA_{\text{NFA}} consisting of all pairs containing an NFA and a string it accepts, which is also decidable.
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.

Acceptance problem for DFAs1Nondeterministic finite automata1Subset construction1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.