TESTS Schedule UPDATED
SYLLABUS Updated.
EXTRA CREDIT; You can earn up to 25
extra credit pts
New 2 Extra Credit Quizzes, each 5pts - 10pts
total
Each TEST will include extra credit PRUIBLEM
(5pts) - total 15 pts.
Professor Office Hours UPDATED
Wednesday 1:00pm - 3:00 pm
WE
HAVE our own CSE303
LECTURES YOUTUBE CHANEL
CSE303:
Theory of Computation
208 New CS Building
phone: (631) 632-8458
e-mail: anita@cs.stonybrook.edu
Professor Office Hours
Short questions via email any timeTAs Office Hours will be posted and updated on Brightspac
COURSE OBJECTIVES
Introduce abstract models of computation
such as finite and push-down automata, and
analyze their relative expressive power.
Explore the connection between abstract
machine models and formal languages, as
specified by grammars.
Enhance students awareness of both the power
and inherent limitations of algorithmic
computation via the study of Turing machines
and/or other abstract computational models.
COURSE DESCRIPTION
The course is an introduction to the
abstract notions encountered in machine
computation. Topics include finite automata,
regular expressions, and formal languages,
with emphasis on regular and context-free
grammars. Questions relating to what can and
cannot be done by machines are covered by
considering various models of computation,
including Turing machines, recursive
functions, and universal machines.
EQ1 -
Extra credit Q1
Thursday, February
19
MIDTERM 1
Tuesday, March 10
SPRING BREAK
March 16 - March 20
Q2 - Extra
credit Q2
Thursday, April 9
MIDTERM 2
Tuesday, April
21
FINAL - May 12, 5:30pm -
8:30pm
Preliminary STUDY PLAN
WEEK 1:
Class Lecture 1
VIDEO Lecture 1
Chapter 1: Sets, Relations,
and Languages
WEEK 2:
Class
Lecture 2,4
VIDEO Lecture 1
Chapter 1:
Sets,
Relations, and Languages
WEEK 3:
Class
Lecture 4a Chapter 1 Review
Class Lecture 5
VIDEO Lecture 2
Chapter 2: Finite
Automata - Deterministic
Automata FIRST PART
WEEK 4:
Class Lecture 5
VIDEO Lecture 2
Chapter 2: Finite
Automata -
Deterministic
Automata
SECOND PART
WEEK 5:
Class Lecture
5
VIDEO Lecture 2
Chapter 2:
Finite Automata
- Nondeterministic Automata
WEEK 6:
Class
Lecture 6, 6a
VIDEO Lecture 2
Chapter
2: Finite
Automata - Nondeterministic
Automata
WEEK
7:
Class
Lecture 7
VIDEO Lecture 2
Chapter 2: Finite
Automata - Finite
automata and
Regular
Languages
WEEK 8:
Spring
Break, March 16 -20
VIDEO Lecture 2
Chapter
2: Finite
Automata - Closure
Theorems, Main Theorem
WEEK 9:
Class
Lecture 8
Video Lecture 2
Book Chapter 2: Finite
Automata - Languages that
are not Regular, Pumping
Lemma
WEEK
10:
Book Chapter 3: Context Free
Grammars
THE FULL
STUDY PLAN will
be POSTED on
BRIGHTSPACE
Make-up exams will be given only in
extenuating circumstances
For example doctor's note stating that
you were ill and unfit to take the
exam
Students who miss an exam for a valid
reason must contact the instructor
immediately
to take a make-up exam at the earliest
possible time
Specific arrangements will be
made on a case-by-case basis