ConceptTheory & Algos
Acceptance problem for DFAs
The language consisting of all pairs containing a DFA and a string it accepts, which is shown to be decidable.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.