Search Results

MA 380 Theory of Computation 3 Cr.

This course introduces the theory of computability, including important results from the study of automata and formal languages. Includes introductory material about the theory of directed graphs and trees. A discussion of automata and their relationship to regular, context free and context-sensitive languages. General theories of computability, including Turing machines, and recursive functions. Further topics include decidability, undecidability and computational complexity. 3 Lecture hours. Prerequisite: MA 306. Offered: Spring, even years.

Computer Science

Residential Programs Catalog

...301 Software Engineering 3 MA 306 Discrete Mathematics 3 MA 380 Theory of Computation 3...

Electrical & Computer Engineering

Residential Programs Catalog

...CS 301 , MA 303 , MA 310 , MA 312 , MA 380 , MA 405 , MA 407 , PS...