CS 408 - Automata and Formal Languages

This course is an introduction to the theoretical foundations of Computer Science. Topics include regular languages and finite state machines, context-free languages and push-down automata, Turing machines and recursive function theory, and undecidability. Even though the material is mathematically rigorous and abstract in nature, the concepts find numerous applications throughout many sub-fields of Computer Science, and form the basis for such important issues as the design of computer hardware, compilers, and operating systems.
Lecture
Credits: 3
Prerequisites: MTH 310 and CS 301
Equivalent(s): MTH 408
Offered in Spring Semester