Listed in: Computer Science, as COSC-38
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. Spring semester. Professor Rager.