CSE 355 (Fall 2009) – Arizona State University
Instructor: Georgios Fainekos

Class Schedule

Notes:

1.       In general, the schedule is tentative. It might be required to spend more time on some subjects, while other subjects might be easier.

2.       All the documents, slides, homework etc are/will be available on blackboard.

 

DATE

#

TOPIC

CHAPTER  (Sipser)

REQUIRED READING (Sipser)

RECOMMENDED READING

SLIDES

HOME-WORK

2009/8/24

1

Introduction & Motivation

Chapter 0

pp. 1-3

2009/8/26

2

Mathematical review

pp. 3-16

2009/8/28

3

Proof techniques

pp. 17-24

x

2009/8/31

4

Basics of Formal Language Theory

pp. 13-14

Chapter 1 from lecture notes (pp. 1-24)

2009/9/2

5

Finite automata

Chapter 1

pp 31-43

Chapters 2.1 & 2.2 from lecture notes

2009/9/4

6

Regular operations and introduction to Nondeterminism

pp 44-50

Pages 46-50 from lecture notes

HW 1 due

2009/9/7

 

NO CLASS - UNIVERSITY HOLIDAY

2009/9/9

7

Examples of NFA and equivalence of NFA and DFA

pp 51-58

Pages 50-60 describe an improved algorithm for NFA to DFA conversion

 

 

2009/9/11

8

Regular operations & Introduction to regular expressions

pp 58-66

2009/9/14

9

Equivalence of regular expressions with finite automata

pp 66-72

2009/9/16

10

Equivalence of regular expressions with finite automata

pp 72-76

2009/9/18

11

Nonregular Languages

pp  77-82

Lecture notes on the blackboard

2009/9/21

12

Nonregular Languages continued

pp  77-82

Lecture notes on the blackboard

2009/9/23

13

Problem session on Sipser/Chapter 1 with the TA

HW 2 due

2009/9/25

14

Context Free Grammars

Chapter 2

pp 99-105

Pages 139-152 from lecture notes

2009/9/28

15

Ambiguity, Chomsky normal form

pp 105-109

Pages 153-173 from lecture notes

2009/9/30

16

Pushdown Automata

pp 109-115

JFLAP examples

HW 3 due

2009/10/2

17

Equivalence of CFGs and PDAs

pp 115-122

2009/10/5

18

Equivalence of CFGs and PDAs continued

pp 115-122

2009/10/7

19

Review of Chapters 0, 1, 2 and practice for the midterm

Review notes

HW 4 due

2009/10/9

 

Midterm 1

2009/10/12

20

Review of languages and applications of automata theory

x

2009/10/14

21

Turing Machines

Chapter 3

pp 137-147

JFLAP examples

x

2009/10/16

22

Variations on Turing Machines and Algorithms

pp 148-154

Sipser pages 154-159

x

2009/10/19

23

Decidable languages

Chapter 4

pp 165-169

Take-home midterm due

2009/10/21

24

Decidable languages continued

pp 170-172

2009/10/23

25

The Halting Problem

pp 173-178

2009/10/26

26

The Halting Problem continued

pp 178-182

HW 5 due

2009/10/28

27

Reducibility

Chapter 5

pp 187-192

x

2009/10/30

28

Reducibility continued

pp 192-198

x

2009/11/2

29

Mapping Reducibility

pp 206-210

2009/11/4

30

Mapping Reducibility and Review of Chapters 3, 4, 5

pp 206-210

Review notes

x

HW 6 due

2009/11/6

31

Review of Chapters 3, 4, 5 –

Takehome Midterm 2

Review notes

2009/11/9

32

An introduction to propositional logic and proofs

x

2009/11/11

 

NO CLASS - UNIVERSITY HOLIDAY

2009/11/13

33

Real-life applications of concepts from Theoretical Computer Science

x

Take-home midterm due

2009/11/16

34

Measuring Complexity

Chapter 7

pp 247-253

x

2009/11/18

35

Complexity relations among models

pp 254-256

2009/11/20

36

The Class P

pp 256-260

x

2009/11/23

37

The Class P continued

pp 260-263

2009/11/25

38

The Class NP

pp 264-270

x

2009/11/27

 

NO CLASS - UNIVERSITY HOLIDAY

2009/11/30

39

NP-completeness

pp 271-276

x

2009/12/2

 

Class cancelled

2009/12/4

40

Probabilistic automata
Presented by Ramin Tadayon

Slides

x

HW 7 due

2009/12/7

41

Final exam review

Exam Review Sheet

2009/12/14

Final exam

9:50 AM-11:40 AM
BYAC 110