Monday Wednesday, 4:005:15, Y22300
Peter Fejer
email: fejer@cs.umb.edu
Office: S3184
Office Hours: M,W 2:003:00, 5:306:00, Tu,Th 1:002:00 and by appt.
Email: kingvo at cs.umb.edu
Office: S3124
Office Hours: Tu,Th 2:004: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/spring2018/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

Jan
22

Finite Automata I

Section 1.1

How to Succeed in CS 420
Introduction
Regular Languages



Jan
24

Finite Automata II

Section 1.1




Jan
29

Nondeterministic Finite
Automata I

Section 1.2




Jan
31

Nondeterministic Finite
Automata II

Section 1.2




Feb
5

Nondeterministic Finite
Automata III
Regular Expressions

Section 1.2
Section 1.3




Feb
7

NonRegular Languages

Section 1.4




Feb
12

ContextFree Grammars I

Section 2.1

ContextFree
Languages



Feb
14

ContextFree Grammars II

Section 2.1




Feb
19

Presidents’ Day





Feb
21

ContextFree Grammars III

Section 2.1


Homework 5


Feb
26

Pushdown Automata I

Section 2.2




Feb
28

Pushdown Automata II

Section 2.2




Mar
5

Pushdown Automata III
NonContextFree Languages I

Section 2.2
Section 2.3




Mar
7

NonContextFree Languages II

Section 2.3




Mar
1216

Spring Break





Mar
19

Turing Machines I

Section 3.1

Computability



Mar
21

Turing Machines II

Section 3.2




Mar
26

Turing Machines III

Section 3.3




Mar
28

First Test





Apr2

Decidable Languages I

Section 4.1




Apr
4

Decidable Languages II
Undecidability I

Section4.1
Section 4.2




Apr
9

Undecidability II

Section 4.2




Apr
11

Undecidability
Undecidable Problems in
Language Theory I

Section 4.2
Section 5.1




Apr
16

Undecidable Problems in
Language Theory II

Section 5.1




Apr
18

Patriots’ Day





Apr
23

Undecidable Problems in
Language Theory III

Section 5.1




Apr
25

Mapping Reducibility I

Section 5.3




Apr
30

Mapping Reducibility I
Measuring Complexity I

Section 5.3
Section 7.1




May
2

Second Test





May
7

Measuring Complexity II
The Class P I

Section 7.1
Section 7.2




May
9

The Class P II
The Class NP
NP Completeness

Section 7.2
Section 7.3
Section 7.4




May
16

Final Exam
3:006:00





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.