2017-2018 Academic Catalog 
    
    Apr 24, 2024  
2017-2018 Academic Catalog [ARCHIVED CATALOG]

CSCI 180 - Automata Theory


Studies the abstract models of machines and languages recognized by them and introduces the concept of computability. Begins with a review of sets, functions and relations, then continues with finite automata and regular languages, pushdown automata and context-free grammars, grammar transformations and normal forms, and finally the mathematical model of modern computers: Turing machines and computable functions. Some examples of unsolvable problems, such as the halting problem, will be discussed. Involves a fourth-hour problem-solving session.

Prerequisites: Prerequisites for this course require a grade of C or better. CSCI 121  and MATH 114 .

Anticipated Terms Offered: Offered every year