MATH 8666

AUTOMATA, COMPUTABILITY, AND FORMAL LANGUAGES

University of Nebraska at Omaha · UGRD · Fall 2026

1 section

Catalog description

This course presents a sampling of several important areas of theoretical computer science. Definition of formal models of computation and important properties of such models, including finite automata and Turing machines. Definition and important properties of formal grammars and their languages. Introduction to the formal theories of computability and complexity. (Cross-listed with CSCI 4660 , CSCI 8666 , MATH 4660 ).

Sections

Current meeting, instructor, credit, and enrollment details

Updated 8 hours ago

001

Availability not recently verified

Class #nebraska_omaha-MATH8666Fall 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?