Automata, Formal Languages, and Computability

CT Score

1500

#0 of 0 in COMP

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

( COMP 382 or MATH 306 or MATH 356 ) Description: Finite automata, regular expressions, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages, computability, and solvability. It is strongly recommended that students complete three semesters of Mathematics before enrolling in this course. Graduate/Undergraduate Equivalency: COMP 581 . Mutually Exclusive: Cannot register for COMP 481 if student has credit for COMP 581→COMP 481→unlocks 3 courses

3 mapped courses list COMP 481 as a prerequisite. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.