Introduction to the theory of formal languages and automata with an emphasis on the classes of languages commonly encountered by computer scientists. Computability examines the solution of decision problems; the Church-Turing thesis; the undecidability of the Halting Problem; and problem reduction and undecidability. Department Managed Prerequisite(s): Undergraduate level CS 3100 Minimum Grade of D or Graduate level CS 5100 Minimum Grade of D
Must be enrolled in one of the following Levels: Graduate, Medical, Professional. Must be enrolled in one of the following Colleges: College of Egr & Computer Sci.