My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 5349 (Overall) | |||||
CS 5349 Serdar Erbatur | |||||
Not teaching in Spring 2026 | |||||
CS 5349 Bhadrachalam Chitturi | |||||
CS 5349 Neeraj Gupta | |||||
CS 5349 Zachary Stallbohm | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 5349 (Overall) | |||||
CS 5349 Serdar Erbatur | |||||
Not teaching in Spring 2026 | |||||
CS 5349 Bhadrachalam Chitturi | |||||
CS 5349 Neeraj Gupta | |||||
CS 5349 Zachary Stallbohm | |||||
Automata Theory
CS 5349
Erik Jonsson School of Engineering and Computer Science
Deterministic and nondeterministic finite automata; regular expressions, regular sets, context-free grammars, pushdown automata, context free languages. Selected topics from Turing Machines and undecidability. 3 credit hours.
Prerequisite: CS 5333.
Offering Frequency: Each semester
This professor/course combination hasn't been taught in the semesters you selected. To see more grade data, try changing your filters.
Grades: 0
Median GPA: None
Mean GPA: None
Click a checkbox to add something to compare.
Automata Theory
CS 5349
Erik Jonsson School of Engineering and Computer Science
Deterministic and nondeterministic finite automata; regular expressions, regular sets, context-free grammars, pushdown automata, context free languages. Selected topics from Turing Machines and undecidability. 3 credit hours.
Prerequisite: CS 5333.
Offering Frequency: Each semester
This professor/course combination hasn't been taught in the semesters you selected. To see more grade data, try changing your filters.
Grades: 0
Median GPA: None
Mean GPA: None
Click a checkbox to add something to compare.