CPSCI-210 Applied Theory

An investigation of the nature of computation through development of several models of computation. Topics include finite state machines, pushdown automata and Turing machines, the Chomsky language hierarchy, discussion of computational complexity, and illustration of how these abstract models of computation may be applied to language recognition problems such as lexical analysis and parsing.

Maximum Enrollment

Standard Course (40)

(Quantitative and Symbolic Reasoning.)

Credits

1

Prerequisite

123; or, senior standing and permission of instructor.

Offered

Fall