CSI 5310Intro to Computation Theory

Baylor University · 3 credits · UGRD

Catalog

Several models of computation (including finite automata, pushdown automata, and Turing machines) and their related languages. Topics include closure properties, regular languages, context-free languages, decidability and recognizability, and time and space complexity (including NP-completeness and randomized complexity).

Recent sections

Fall 2026 · 1 section

Aug 24 – Dec 9

Section	Days & time	Location	Instructor
01Class #50418	Mo We Fr · 11:15 AM – 12:05 PM	CASHN C202	Greg Hamerly