Tuesday Thursday 12:301:45, W2200
Peter Fejer
email: fejer@cs.umb.edu
Office: S3184
Office Hours: Tu Th 2:003:30, W 2:003:00, and by appt.
Email: kingvo at cs.umb.edu
Office: S3124
Office Hours: TT 2:003:00
Introduction to theoretical aspects of computing, including models of computation, inherent limits on computation, and feasible computation.
Prerequisites: CS 320L (or equivalent).
· For some topics in the course, I am using slides prepared by Prof. Emanuele Viola of Northeastern University. These slides are used with his kind permission. The slides are organized by chapter rather than by section of the textbook. Links to these slides on Prof. Viola’s webpage are given in the syllabus below.
· This course is in the UMB Blackboard and in piazza. You can log into Blackboard with your UMB ID at umb.umassonline.net. The piazza page is accessible from Blackboard, but can also be reached directly at piazza.com/umb/fall2017/cs420/home. Both Blackboard and piazza contain links to this page.
· Class lectures are being recorded using the Echo 360 system. You can find the class recordings in Blackboard.
Date

Topic

Textbook
Section(s)

Slides

Homework and
Solutions

Test Study
Material and Solutions

Sep
5

Finite Automata I

Section 1.1

How to Succeed in CS 420
Introduction
Regular Languages



Sep
7

Finite Automata II

Section 1.1




Sep
12

Nondeterministic Finite
Automata I

Section 1.2




Sep
14

Nondeterministic Finite
Automata II

Section 1.2




Sep
19

Nondeterministic Finite
Automata III
Regular Expressions

Section 1.2
Section 1.3




Sep
21

NonRegular Languages I

Section 1.4




Sep
26

ContextFree Grammars I

Section 2.1

ContextFree
Languages



Sep
28

ContextFree Grammars II

Section 2.1




Oct
3

ContextFree Grammars III

Section 2.1




Oct
5

Pushdown Automata I

Section 2.2




Oct
10

Pushdown Automata II

Section 2.2




Oct
12

Pushdown Automata III
NonContextFree Languages I

Section 2.2
Section 2.3




Oct
17

NonContextFree Languages II

Section 2.3




Oct
19

Turing Machines I

Section 3.1

Computability

Homework 7
Solutions


Oct
24

Turing Machines II

Section 3.2




Oct
26

First Test





Oct
31

Turing Machines III

Section 3.3




Nov
2

Decidable Languages I

Section 4.1




Nov
7

Decidable Languages II
Undecidability I

Section4.1
Section 4.2




Nov
9

Undecidability II

Section 4.2




Nov
14

Undecidability
Undecidable Problems in
Language Theory I

Section 4.2
Section 5.1




Nov
16

Undecidable Problems in
Language Theory II

Section 5.1


Homework 10
Solutions


Nov
21

Undecidable Problems in
Language Theory III

Section 5.1




Nov
23

Thanksgiving





Nov
28

Mapping Reducibility I

Section 5.3




Nov
30

Mapping Reducibility I
Measuring Complexity
I

Section 5.3
Section 7.1




Dec
5

Second Test





Dec
7

Measuring Complexity II
The Class P I

Section 7.1
Section 7.2




Dec
12

The Class P II
The Class NP
NP Completeness

Section 7.2
Section 7.3
Section 7.4



Supplemental
Homework
Supplemental
Homework Solutions

Dec
21

Final Exam





Some
files will be available in Postscript format only. If you want to view
and print Postscript files at home, you need Ghostscript
and Ghostview. You can get them by clicking here.
·
Download Ghostscript
and GSview for reading PostScript files.