Find a university to explore its courses and reviews.
Formal models of computation including finite automata, regular expressions, context-free grammars, pushdown automata, and Turing machines.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Anonymous · no account needed · 10 seconds