CS 41000

Automata And Computability

Purdue University Northwest · UGRD · Fall 2026

1 section

Catalog description

A finite automaton is a mathematical model for a computational system. Computer science embodies many examples of finite state systems. This course will cover the basic principles of deterministic and non-deterministic finite automata, Turing machines, formal language theory, regular expressions, context-free grammers, the halting problem, and unsolvability. Typically offered Fall. Prerequisite(s): CS 27500 FOR LEVEL UG WITH MIN. GRADE OF C- AND CS 30900 FOR LEVEL UG WITH MIN. GRADE OF C- View Class Schedule

Sections

Current meeting, instructor, credit, and enrollment details

Updated 3 hours ago

001

Availability not recently verified

Class #purdue_northwest-0493Fall 2026UGRD3.00 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?