Contact:
100 Morrissey Blvd.
McCormack 3rd Floor
Rm 3-201-32
Computer Science Dept.
Boston, MA 02125-3393 USA

Email: jane.deblois'at'umb.edu

Lecturer

Welcome to CS420-01 Introduction to Theory of Computation!

Syllabus Rev2 posted Sep 30 version of Sipser textbk revised to say 3rd edition, not 2nd

WEEK1:

pre-requisite hw0 is posted on canvas as of sep 5th

CS Server hw0 (optional) is posted here as of sep 9th

InClassSep9 - Q1, Q2

Lecture01.pdf Intro to Theory of Computation from class on Wed Sep 9

Initial reading to help you get started: hmu ch1.2-1.4

hw1: Q1 Proof Practice (Handwrite the Justifications) and Q2 Run a DFA (Bonus 4pts is for submitting an incremental by Mon) posted Sat Sep 12 due Tues Sep 15 at 11:59pm on CS server in course dir/cs420

hw1: Q0 mkdir hw1 on CS server in course dir, make readMe1.txt in class as handwritten anwers and/or a file on the CS server in hw1 dir, both due by end of class Mon Sep 14 (I thought you could view it on canvas, but seems not, so it's here to prepare, but you have to handwrite it in class on the page I give you.)

WEEK2:

Lecture02.pdf Using and Proving Logical Statements from class on Mon Sep 14

example of latex starter.tex (type pdflatex starter.tex to get starter.pdf)

example of latex starter.pdf

Lecture03.pdf Deterministic Finite Automata (DFAs) from class on Wed Sep 16

a list of some criteria for points off for hw1 in past years, to explain care needed in writing proofs

WEEK3:

Lecture04.pdf Computing with DFAs for class on Mon Sep 21

hw2 in 3 parts with error in prob 3 corrected

5 slides from lecture 1 - slide 26 was discussed in class in groups

Lecture05.pdf Regular Languages for class on Wed Sep 23

whiteboard sep23 wed list for readMe-hw2; requests useCase - pls resubmit with changes and with your final hw2

WEEK4:

Lecture06.pdf Combining DFAs, Closed Ops Mon Sep 28

MIT helps out with humor and skills

hw3 posted Mon Sep28

Lecture07.pdf Nondeterminism and NFAs Wed Sep 30

Presentations - reading one definition from Sipser 3rd Ed, p 44, Def 1.23 regular operations - union, concatenation, star - Wed Sep 30

WEEK5:

Lecture08.pdf Computing with NFAs Mon Oct 5

Summary: important slides in lec 1-9

hw4 posted Wed Oct 7 Due Tue Oct 13 at noon

Figure for hw4, Q3: see ihw1, Q2 (reposted here from above)

hw4: subdir and readMe4 due oct 7: mkdir hw4 on CS server, handwrite readMe4.txt in class; also create hw4/readMe4.txt on CS server, add updates, submit on oct 13

Lecture09.pdf NFA-DFA Wed Oct 7

WEEK6:

Lecture10.pdf Regular Expressions - Wed Oct 14

ONLY DO Q1 & Q2!! Name it hw5.pdf or hw5a.pdf. Name next week's hw5b.pdf! hw5 posted Wed Oct 14 Due Tue Oct 20 at noon CAUTION- Submit to CS server not gradescope!

You need this for ENC

WEEK7:

Lecture11.pdf - Inductive Proofs - Mon Oct 19 reading is Sipser 1.3 and 0.4, cover: inductive proof, ex. from 0.4 induction example, proof that a lang is reg iff some reg expr describes it, language REVERSE is closed op, non-reg langs, logical inference, proof by contradition, pumping lemma (show a lang is not regular)

sipser-p24-25

sipser-p72-73

sipser-p74-75

inclass-oct19.txt

WEEK8:

Homework07.pdf - Due Mon Nov 2 - submit on CS server as hw7.pdf, not gradescope - 4 problems - handwrite parse trees, justifications in proofs and PDA diagrams - submit readme.txt as a separate file

Lecture13.pdf - Context Free Grammars (CFGs) and Context Free Languages (CFLs) - Mon Oct 26

Lecture15.pdf - CFGs vs Push Down Automata (PDAs) and subCFLs and Deterministic PDAs - Wed Oct 28

Homework07, p1

Homework07, p2

Homework07, p3

Homework07, p4

oct28.txt for week8 Wed

WEEK9:

Lecture16.pdf - Turing Machines - 45 slides - Mon Nov 2

Lecture17.pdf - Turing Machine Variants - 38 slides - Wed Nov 4

Homework08.pdf - covers Context Free Languages (CFLs) and starts Turing Machines (TMs) - Due Mon Nov 9 - submit on CS server as hw8.pdf, not gradescope - 3 problems - handwrite justifications in proofs and PDA diagrams - submit readMe.txt as a separate file

nov2.txt for week9 - Sipser Intro reviewed and Ch 3 - Turing machines - 3.1, 3.2 (for wed), 3.3

WEEK10:

Lecture18.pdf - Decidability - first 60 slides of 136 slides - Chomsky Normal form pp 108-111 is included - Mon Nov 9

Homework09.pdf - Due Mon Nov 16 - submit on CS server as hw9.pdf, not gradescope - do problems 1, 2 and 4 only - handwrite justifications in proofs - submit readMe.txt as a separate file

nov9.txt for week10 - Ch 3 - Turing machines - 3.3 Algorithm, Hilbert's problems, 1936 papers of Alonzo Church and Alan Turing (Sipser, p 183 - Fig 3.2 The Church-Turing Thesis; Seven Millennium Prize Problems - 166 page proof of singlarities possible in Navier Stokes equation for Computational Fluid Dynamics; then: Ch 4 - Decidability - 4.1 Decidable Languages, p194 Acceptance problems and Emptiness problems