CSCE 428/828: Automata, Computation, and Formal Languages

Prereqs: CSCE 235; CSCE 310 or CSCE 311.
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.
Credit Hours: 3
Course Format: Lecture 3
Course Delivery: Classroom


This is the site for old bulletin data. Please head to UNL's Course Catalog for updated course and program information.