 |
CSCI180
- Automata Theory/Lecture, Discussion
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 for this course require a grade of C or better. Prerequisites: CSCI121 and MATH114. Mr. Green, Ms. Han, Mr. Joyce/Offered every year
Faculty
Frederic Green, Ph.D. - Professor and Chair, Department of Mathematics
and Computer Science
Li Han, Ph.D. - Assistant Professor of Mathematics and Computer Science
David Joyce, Ph.D. - Professor of Mathematics
|
| |
|
Additional Resources
|
|
|
|
