Jay Pantone

John Wesley Young Research Instructor
Dartmouth College


Math 118

Spring 2017

In this course we'll learn about Language Theory as a tool for solving combinatorial problems. The course will cover many classical topics---finite automata, regular automata, and context-free grammars---as well as a selection of more advanced topics, including transducers, Ogden's Lemma, and decidability problems. Along the way, we'll present many applications of language theory to combinatorial problems.

  • Lectures:
    M, W, F: 12:50pm - 1:55pm
    Kemeny 004
  • Office Hours:
    Monday, 10:00am - 11:00am
    Tuesday, 1:00pm - 2:00pm
    Friday, 10:00am - 11:00am

Course Information

The official syllabus is here.

Homework Assignments

Grading Scheme

There will be a total of 200 possible points to be earned through four homework assignments. Grades will be assigned according to the following scale.

High Pass: 175 - 200 points
Pass: 125 - 174 points
Low Pass: 100 - 124 points
Fail: 0 - 99 points
Homework Policy

You may, and in fact are encouraged to, discuss the homework problems with your classmates. However, each student must turn in their own assignment, in their own words. It is expected that you fully and completely understand the work you turn in; if not, you have relied too much on your classmates.