ConceptTheory & Algos
Non-regular languages
Languages that cannot be recognized by any Deterministic Finite Automaton (DFA).
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 automata1Regular language1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.