CS 301: Languages and Automata
Fall 2015

Instructor: Stephen Checkoway, sfc@uic.edu
Required textbook: Michael Sipser, Introduction to the Theory of Computation, 3rd ed.
Optional textbook: Richard Hammack Book of Proof (available online)

Lectures: Tuesday and Thursday. 09:30–10:45 in Lecture Center F, room F4
Discussion: Friday

Exam 1: Tuesday, September 29, 2015
Exam 2: Tuesday, October 27, 2015
Final: Wednesday, December 9 at 10:30–12:30



Your work will be assessed through three mechanisms: exercises, problem sets, and exams. Grades will be determined as follows:


You may collaborate with as many other students in the class as you like on the exercises. You must write up your solutions on your own. Exercises will be collected at the beginning of class on the day they're due and checked off for completeness but individual problems will not be graded for correctness. (These do still count toward your grade, so make sure you do them all.)

It is recommended, but not required, that you write up your exercise solutions in LaTeX (see below). A LaTeX template for exercises #1 is here.

Solutions to the exercises (including the LaTeX source) will be available on Piazza after the due date.

Problem sets

You must solve the problem sets on your own, without discussing them with anyone other than course staff. You must write up your solutions on your own. Further, solutions to problem sets must be written in LaTeX (see below). Problem sets are to be turned in as PDFs on Blackboard and will be graded for correctness.


There are two, 75-minute, in-class exams at the times listed above. Each in-class exam is worth 12.5% of your grade. There is a final exam worth 25% of your grade that will be given on the scheduled final exam day. The exams are closed book; however, you are allowed to bring in one sheet of 8.5" by 11" paper filled on both sides with any information you think you'll need.

Any student who does not take the final exam will fail the course. There will be no makeup exams.


There are two tools that you will be using throughout this course, LaTeX and JFLAP.

LaTeX is a typesetting system which you will use to write up solutions to the problem sets. Here is an example proof written in LaTeX. Here is the LaTeX source.

LaTeX distributions are available for OS X, *NIX, and Windows:

There are a number of good references on the Web including

There are many tools that can assist in writing LaTeX, including a variety of specialized editors such as Texmaker and TeXShop as well as add ons for editors like Emacs (AUCTeX is probably the best of them) and Vim.

Writing your solutions in LaTeX will take time at first, but as you become more familiar with it, you'll find that it's an invaluable tool. I strongly recommend you learn to use it well.

JFLAP is software that you may use for building some of the machines we will be discussing such as DFAs and Turing machines. Nothing in the class requires you to use the software, but I recommend it. It's a good way to test your solutions before turning them in.

You can also using JFLAP as an easy way to produce diagrams for your DFAs, NFAs, etc. that you can then save as PDF and include as graphics in your problem sets (and exercises). There is a tutorial as well.