Listed in: Computer Science, as COSC-401
John E. Rager (Section 01)
This course covers basic mathematical concepts that are essential in computer science and then uses them to teach the theory of formal languages and machine models of languages. The notion of computability will be introduced in order to discuss undecidable problems. The topics covered include: regular, context-free and context-sensitive languages, finite state automata, Turing machines, decidability, and computational complexity. Offered in alternate years.
Requisite: None, although analytical aptitude is essential. Limited to 50 students. Fall semester: Professor Rager.
How to handle overenrollment: Priority to majors
Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: (none specified)
Section 01
M 12:00 PM - 12:50 PM SCCE A131
W 12:00 PM - 12:50 PM SCCE A131
F 12:00 PM - 12:50 PM SCCE A131
| ISBN | Title | Publisher | Author(s) | Comment | Book Store | Price |
|---|---|---|---|---|---|---|
| Introduction to the Theory of Computation | Cengage 2013 | Sipser | TBD |