CS
522
Formal Languages and Automata Theory
4 cr.
(4-0-0)
- Graded: A/F
- Prerequisites: CS 510 or instructor permission.
- Bulletin Year: 2023 - 2024 Graduate Bulletin
This is a course on automata, formal languages, and computability. Topics include context-free grammars, parsing, normal forms, deterministic and nondeterministic finite automata, regular languages, pumping lemma, push-down automata, and deterministic parsing, deterministic and nondeterministic Turing machines.