CSCE 428

Automata, Computation, and Formal Languages

University of Nebraska-Lincoln · UGRD · Fall 2026

1 section
Add to a schedule

Catalog description

Introduction to the classical theory of computer science. Finite state automata and regular languages, minimization of automata. Context free languages and pushdown automata, Turing machines and other models of computation, undecidable problems, introduction to computational complexity.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 6 hours ago

001

Availability not recently verified
Class #nebraska_lincoln-CSCE428Fall 2026UGRD3 credits
Days & times
No scheduled meeting time
Meeting dates
Location
Instructor
Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?