CSE 211: Theory of Computation

Contact:

Dr. Masud Hasan

Room: CSE 657, Phone: x7738

Email: masudhasan AT cse DOT buet DOT ac DOT bd

Course web: http://teacher.buet.ac.bd/masudhasan/cse211.html

                    http://203.208.166.84/masudhasan/cse211.html               

Announcements:

• Class Test 1: 20/12/2009 (Sunday) or next available class. Syllabus: Ch 1, 2, 3; see detail below.

• Class Test 2: 6/1/2010 (Wednesday). Syllabus: Ch 4, 5; see detail below.

• Class Test 3:

Class Test marks and answer sheets:

• Class Test Marks [pdf]

• Answer Sheet [CT1] [CT2]

Readings:

• [HMU] Introduction to Automata Theory, languages, and Computation, by Hopcroft, Motwani and Ullman, 3rd edition [Collect this book]

• Class Note

• Stanford University Webpage: http://infolab.stanford.edu/~ullman/ialc.html

Syllabus:

• Related pre and post ambles of sections/bullets are by default included

• Class notes are by default included

• All related exercises are by default included

• Stanford University webpage: http://infolab.stanford.edu/~ullman/ialc.html contains many helpful materials, such as solution to some exercises, and Stanford class note materials indicating important topics.

• Preface

• 1.1, 1.5, Related Exercise

• 2.1, 2.2, 2.3, 2.4 (self study), 2.5, 2.7, Related Exercise

• 3.1, 3.2 (excluding 3.2.2), 3.3 (self study), Related Exercise

• 4.1, Related Exercise

• 5.1, 5.2.1, 5.2.2, 5.3 (self study), 5.4, Related Exercise

• 6.1 (Idea only for Theorems and Proofs)

• 7.1, 7.2 (Idea only for Theorems and Proofs)