Computer Science 501 - Formal Language Theory

Introduction to formal language theory. Topics include finite state languages, context-free languages, the relationship between language classes and formal machine models, the Turing Machine model of computation, theories of computability, resource-bounded models, and NP-completeness. It is recommended that students have a B- or better in COMPSCI 311 in order to attempt COMPSCI 501.

Open to junior & senior Math and Computer Science students who have completed COMPSCI 311 with a grade of C or better. LEC 01 FOR UNDERGRADS; LEC 02 FOR GRADS. IT IS RECOMMENDED THAT UNDERGRADUATE STUDENTS HAVE A GRADE OF B- OR BETTER IN COMPSCI 311 IN ORDER TO ATTEMPT 501. INSTRUCTOR WILL CONSIDER CONCURRENT ENROLLMENT WITH COMPSCI 311 FOR STUDENTS WHO HAVE COMPLETED COMPSCI 250 WITH A GRADE OF A, IF AVAILABLE SEATS. SEATS HELD IN LECT 02 FOR INCOMING GRAD STUDENT REGISTRATION. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/academics/course-overrides