CSC 6003 - Theory of Automata & Formal Languages

3 Credit Hours

An introductory course to the formal languages and automata. This course provides a challenging introduction to some of the central ideas of theoretical computer science. It presents a vision of “computer science beyond computers,” that is, computer science as a set of mathematical tools for understanding complex systems. The course introduces students to computational thinking. The course focuses on context-free and regular languages. Topics include regular grammars , detem1inistic and non-deterministic finite state machines, parsing algorithms, linear-bounded automata, properties of regular languages , the Pumping lemma, and the use of Turing machines to introduce the P=NP problem.

Prerequisite: CSC 2253 Discrete Structures and CSC 2403 Algorithm Design and Analysis
Availability: Spring

View textbook information.