Automata and Formal Languages

CSE 5321

Transcript Abbreviation: 
Automata Form Lang

Course Description: 
Machine-based and grammatical models of computation; finite automata and regular languages, pushdown automata and context-free languages, Turing machines; non-determinism; Church?s Thesis; halting problem.

Course Levels: 
Undergraduate (1000-5000 level)
Graduate

Designation: 
Elective

General Education Course:
(N/A)

Cross-Listings:
(N/A)