CSE 5083 - Formal Languages and Automata Theory
Course Number: CSE 5083
Credit Hours: 3
Catalog Data: CSE 5083 Formal Languages and Automata Theory (3 credits). This course presents the theory of finite automata: finite-state machines, pushdown automata, bounded linear automata, and Turing machines. The corresponding theory of languages: regular, context-free, context-sensitive and recursively enumerable languages, is presented.
Possible Textbook: Introduction to Automata Theory, Languages and Computation, by Hopcroft and Ullman. Addison-Wesley 1979.
Coordinator: William Shoaff/Roger Marshall
Goals: This course introduces the students to the theory underlying the development of machines and languages. The student is introduced to the main classes of machines and languages they recognize. Questions of what can and cannot be computed with these machines are addressed. Besides learning abstract theory, which is useful in its own right, students will be exposed to data and control structures that are useful in many applications of computer science.
Prerequisite: Discrete Mathematics, Data Structures.
Course Outline