CSC-4890 - Introduction to Theory of Computation

Fall 2008

 

Course Information

 

Class Location and Time: Tureaud Hall 225, Tuesday & Thursday 10:40am-12:00pm

 

Instructor:  Konstantin Busch

Office: 286 Coates Hall

Office Hours: Tuesday & Thursday 1:00-2:30pm

Phone:  225-578-7510

Email: busch (at) csc lsu edu

 

Teaching Assistant: Suman Kumar

Office: Coates Hall 1st Floor, Sensor Network Lab

Office Hours: Friday 1:00-2:00pm

Email: skumar4 (at) lsu edu

 

Textbook: Introduction to the Theory of Computation, by Michael Sipser, second edition, PWS Publishing Company.

 

Detailed Information: Syllabus

 

Homeworks

 

Homework1, due September 25, 5:00pm

Homework2, due October 7, 5:00pm

Homework3, due October 28, 5:00pm

Homework4, due November 10, 5:00pm

Homework5, due November 25, 5:00pm

Homework6, due December 5, 5:00pm

 

 

Slides & Schedule

 

DAY

TOPIC

CHAPTER

Tuesday August 26

Introduction

0

Thursday August 28

Languages

0

Tuesday September 9

Deterministic Finite Automata, Regular Languages

1

Thursday September 11

Nondeterministic Finite Automata

1

Tuesday September 16

Properties of Regular Languages

1

Thursday September 18

Regular Expressions

1

Tuesday September 23

Pumping Lemma for Regular Languages

1

Thursday September 25

More Pumping Lemma Examples

1

Tuesday September 30

Context-Free Grammars & Languages

2

Thursday October 2

Grammar Normal Forms

2

Tuesday October 7

Compilers & Parsers

2

Thursday October 9

Pushdown Automata

2

Tuesday October 14

Review of Regular Languages

Thursday October 16

Exam 1- Regular Languages

Tuesday October 21

Pushdown Automata & Context-Free Languages

2

Thursday October 23

Pumping Lemma for Context-Free Languages

2

Tuesday October 28

Turing Machines

3

Thursday October 30

Variations of Turing Machines

3

Tuesday November 4

Universal Turing Machine

4

Thursday November 6

Decidable Languages

Chomsky's Hierarchy

4

Tuesday November 11

Undecidable Problems

4

Thursday November 13

Reductions for Decidability

5

Tuesday November 18

Review of Context-Free Languages

Thursday November 20

Exam 2 - Context-Free Languages

Tuesday November 25

Time Complexity

7

Tuesday December 2

NP-Completeness – Cook’s Theorem

7

Thursday December 4

NP-Complete Reductions

7

 

 

Extra Reading Material

Mathematical Preliminaries

Decidable problems on Regular and Context-free languages

Grammars for regular languages

Deterministic pushdown automata (DPDA)

Properties of context-free languages

More examples of pumping lemma for context-free languages

Post-Correspondence Problem

Other models of computation