ConceptTheory & Algos
Decidability of
The emptiness problem for DFAs asks whether a given DFA recognizes the empty language, and is decidable by checking if there is a path from the start state to any accept state.
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
1Connections
2The lectures that define it or assume it, and the concepts next to it.