CS 381Formal Languages

University of Evansville · 3.0 credits · UGRD

Catalog

Models of computation including finite automata, regular grammars, regular expressions, pushdown automata, context-free grammars, Turing machines, computability, and undecidability. Prerequisites: CS 210; MATH 370. Fall.

Recent sections

Fall 2026 · 1 section

Aug 26 – Dec 17

Section	Days & time	Location	Instructor
01Class #63997	Mo We Fr · 10:00 – 10:50 AM	Koch Center 267	Zhang, Z
01 notes: Instructional method: Lecture