The midterm will be held on Tuesday June 19 at 7:00-8:50 pm in STC 0010. The alternate sitting, for those who have conflicts and have already arranged it with me, will be at 4:30-6:20 pm in DC 3126.
The midterm is closed-book (i.e. no aids will be permitted). The midterm will cover everything from Lectures 1-12 (regular languages, context-free languages). You may use any result that we have proved in class or on the assignments.
You should have a good grasp of the definitions of each language class and their representations and you should understand the properties of each language class and their representations (closure properties, determinism vs nondeterminism, ambiguity, etc.). Generally, you can expect the kinds of questions to be asked to be similar in flavour to the assignment questions, although they will not be as involved.
There are two flavours of question. The first is true/false; here, you'll be asked to determine whether or not a statement is true or false, with no proof necessary. The second are the usual problems that you've seen on assignments.
You will not be asked to perform any lengthy algorithms (subset construction, Chomsky normal form, etc.) although you should know what they are supposed to show. You will not be expected to explicitly list every part of a machine/grammar when asked to present a construction. You will not be asked to formally show via induction that a machine/grammar accepts/generates a language, although you should be able to generally explain why it's true. However, you will be expected to write a pumping lemma proof properly.