← Computer Science
Automata Theory
Coming soon
This topic is being written. Join our Discord to get notified when it goes live.
Join Discord for updatesWhat this topic covers
- Deterministic Finite Automata (DFA)
- Nondeterministic Finite Automata (NFA)
- DFA ↔ NFA equivalence — subset construction
- Regular expressions and their equivalence to automata
- Minimisation of DFAs
- Pumping Lemma for regular languages