CS622: Theory of Formal Languages
UMass Boston, Fall 2021
Wed, 1 Sep 2021 00:00:00 -0400
Hi Students,
The registrar just announced that our class will be remote until the end of September.
Both lectures and office hours will be conducted via Zoom during this time. Please check Blackboard for the relevant links, and Lecture for more info.
p.s. - The first Zoom lecture will be Wed, Sept 8 at 7pm EST (Boston time). See you there!
Sat, 21 Aug 2021 00:00:00 -0400
Hi Students,
Welcome to CS622! I am looking forward to the semester.
To ensure a smooth start, please fill out this pre-class survey as soon as you can. (Enter your umb.edu credentials into the Google sign-in box to access the survey.) This way I can address any concerns as soon as possible.
Also, please note that CS220/320 (discrete math) is a requirement (and you will need it).
See you in the first class!
Last updated: Tue, 7 Dec 2021 14:40:57 -0500
Schedule (subject to change):
Lectures meet MW 7-8:15pm via Zoom (until Sept 30th).
Readings: S = Sipser; HMU = Hopcroft, Motwani, Ullmann; ST = Simovici, Tenney
# | Date | Topic | Reading | HW out |
1 | 9/8 Wed | Intro to Formal Languages and CS622 [slides] | S0, HMU1.2-1.4 | |
2 | 9/13 Mon | DFAs [slides] | S1.1, HMU2.2 | |
3 | 9/15 Wed | Nondeterminism and NFAs [slides] | S1.2, HMU2.3,2.5 | |
4 | 9/20 Mon | Closure Properties [slides] | S1.1-1.2 | |
5 | 9/22 Wed | Regular Expressions [slides] | S1.3 | |
6 | 9/27 Mon | Non-Regular Languages [slides] | S1.4, ST3.6 | |
7 | 9/29 Wed | Context-free Grammars (CFGs) [slides] | S2.1, HMU5.1 | |
8 | 10/4 Mon | Pushdown Automata (PDA) [slides] | S2.2, HMU6.1 | |
9 | 10/6 Wed | DPDAs and Parsing; Non-CFLs [slides] | S2.3-2.4 | |
no class | 10/11 Mon | Indigenous Peoples’ Day | ||
10 | 10/13 Wed | Turing Machines (TMs) [slides] | S3.1-3.3 | |
11 | 10/18 Mon | Decidability [slides] | S4.1 | |
12 | 10/20 Wed | Undecidability [slides] | S4.2,5.1, HMU9.3 | |
13 | 10/25 Mon | Rice, LBAs, More Undecidability [slides] | S4.2,5.1, HMU8.1,9.5 | |
14 | 10/27 Wed | PCP, Mapping Red., Unrecognizability [slides] | S5.2-5.3, HMU9.5 | |
15 | 11/1 Mon | Turing Machines and Recursion [slides] | S6.1 | |
16 | 11/3 Wed | Decidable Theories [slides] | S6.2 | |
17 | 11/8 Mon | Intro to Time Complexity [slides] | S7.1 | |
18 | 11/10 Wed | P and NP [slides] | S7.2-3 | |
no class | 11/11 Thu | Veteran’s Day | ||
19 | 11/15 Mon | NP-Completeness [slides] | S7.3-4 | |
20 | 11/17 Wed | The Cook-Levin Theorem [slides] | S7.4-5 | |
21 | 11/22 Mon | More NP-Complete Problems [slides] | S7.5 | |
22 | 11/24 Wed | Intro Space Complexity [slides] | S8.1-2 | |
11/25 Thu | Thanksgiving Recess start | |||
11/28 Sun | Thanksgiving Recess end | |||
23 | 11/29 Mon | PSPACE Completeness [slides] | S8.1-8.3 | |
24 | 12/1 Wed | L and NL [slides] | S8.4-6 | |
25 | 12/6 Mon | Hierarchy Theorems [slides] | S9.1 | |
26 | 12/8 Wed | An Intractable Problem [slides] | S9.1 | |
27 | 12/13 Mon | Probabilistic Algorithms [slides] | S10.2 |