Syllabus : http://www.iitg.ernet.in/cse/csecourses/?courseCode=CS205M
Class Timings : Mon-Wed-Fri 12:00pm-12:55pm 2204.
References : My primary reference will be Introduction to Automata Theory, Languages, and Computation by John E. Hopcroft and Jeffery D. Ullman. When I studied the material, I followed this book and hence I am biased towards this. But, as you will find out over the duration of the course, all of the material is extremely standard and can be studied from any book dealing with finite state machines. All the references given in the syllabus page are equally adept at handling the material of the course. Moreover, since proofs are not subjective, any proof technique from any book is acceptable for the course.
Instructor : Deepanjan Kesh(deepkesh@)
Teaching Assistants : Rahul Kuman Kundra(r.kundra@), Ranjan Mandal(ranjan@), Debanjan Sadhukhan(debanjan@)
Evaluation : There will be three examinations. Two of them will be the usual midsem and endsem as decided by academic section, each contributing 30% towards your final score. There will be another exam, to be held towards the end of the course, which will be open time and will contribute 40% towards your score. At the end of the term, your marks will be scaled down to 100. You will require atleast 40 to pass the course. For other grades, I will resort to relative grading. This comes with its own pros and cons - if the class is doing very well, I wont shy away from giving AAs to everybody. On the other hand, if I feel that none of you have grasped the concepts well, then I might not award a single AA.
Assignments : There will not be any assignments given for this course. Instead, the Problems section will be populated gradually over the duration of the course. Your exam performance will be strongly correlated to the percentage of the problems you can solve. You can also contribute towards the problem pool. If you have found out some problems that you found interesting, kindly bring it to my notice. If it is nontrivial, I will add to this page with proper credits to the contributor.
12-AUG-2012
[Automata, Computability and Complexity by Elaine Rich, Pg. 122-123] Give finite automata accepting the following languages over the alphabet {0,1}.
For all the problems you have solved by constructing a non-determinitic finite automata, try to come up with a deterministic machine for the same.
06-AUG-2012
[Picked up from random internet searches] Give deterministic finite automata accepting the following languages over the alphabet {0,1}.
[Hopcroft and Ullman, pg. - 48, from 2.5] Give deterministic finite automata accepting the following languages over the alphabet {0,1}.
[Hopcroft and Ullman, pg. - 50, from 2.10] Give deterministic finite automata accepting the following languages over the alphabet {0,1}.
25-JUL-2012
Prove that a ordered directed tree cannot have cycles.
Prove that there cannot exist any bijection between the set of integers and the set of reals.
[Hopcroft and Ullman, pg. - 50, from 2.10] Write regular expressions for -