2010-2011 Academic Catalog 
    
    May 05, 2024  
HELP
2010-2011 Academic Catalog [ARCHIVED CATALOG]

CSCI 180 - Automata Theory

Type of Course: 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: Prerequisites for this course require a grade of C or better. CSCI 121  and MATH 114 .

Instructor: Mr. Green, Ms. Han, Mr. Joyce

When Offered: 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
Catalog Navigation
  Catalog Home
  History of Clark
  Accreditation
  Academic Program
  Departments, Offices and Special Programs
  Tuition and Financial Aid
  Admissions Requirements
  Undergraduate Academic Policies
  Graduate Academic Policies
  Facilities
  Student Resources
  Programs of Study
  Courses
  Faculty
  The Corporation
  Academic Calendar