The reading list for the breadth exam is Chapters 1-5 and 7-9 of Introduction to Automata Theory by Hopcroft, Motwani and Ullman, Addison-Wesley, 2001.
But, until further notice, the breadth exam will have two questions. The first question will be a grammar synthesis problem. The second question will be a DFA synthesis and proof of correctness problem. See the past exams listed below for sample problems. (The Fall 2006 exam only had one problem.)
Before the breadth exam, I will give a help session in which I work some relevant problems and answer questions about the scope of the exam.
|
|
|