CSE 5321

Automata and Formal Languages

2credits
About this course

Machine-based and grammatical models of computation; finite automata and regular languages, pushdown automata and context-free languages, Turing machines; non-determinism; Church's Thesis; halting problem. Prereq: 2231 or 321, and 2421 or 360, and 2331 or Math 566. Not open to students with credit for 3321 (625).

No grade data yet

Grade distribution data hasn't been published for this course yet. Check back later as more terms become available.

More course details

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades