Find a university to explore its courses and reviews.
Finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and computability.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Takes about 2 minutes. Every review is anonymous — no account needed.