This course covers the theory of computation and application to complex and hard problems. Areas such as finite and push down automata, regular languages, regular expressions, context-free languages, Turing machines, computability, and complexity are studied in detail and applied to computational structures with real-world applications. The science of language such as phrase and context-free languages will also be covered in depth. The course will round out with a study in complexity theory and how it applies to hard computational problems.
MSCS3802: Automata, Computation, and Complexity
Class Program