CIS 625: INTRO TO AUTOMATA AND FORMAL LANGUAGES

Eitan Gurari, Spring 1999

Machine based and formal grammar based models of computation. Finite automata, regular languages. Context-free languages, pushdown automata. Turing machines. Church-Turing thesis. Introduction to the halting problem. (OSU Bulletin, OSU Schedule)

TEXT

E. Gurari, An Introduction to the Theory of Computation, Computer Science Press, 1989 (out of print; first 4 chapters are available in print as course notes).

pointers

GRADING POLICY

Notes:
  1. The exams will be with open notes and open books.
  2. No homework will be accepted after the end of class on due date. The assignments are due in class; don’t turn them in my office or my mailbox.
  3. Those who graduate this quarter will have their final exam on We, June 2, 12:30pm-2:20pm.
  4. Exceptions to the above dates of exams must be arranged with the instructor during the first week of the quarter.
  5. Only part of the homework problems will be graded and they will be identified in advance. However, those who will not solve most of the problems by due time will have nil chances of passing the course (and the same is true for people who miss classes.).
[sample midterm exam] [midterm exam] [sample final exam] [final exam]

TIME/ROOM MWF; 10:30-11:20, EL2004; 11:30-12:20, DL 305

INSTRUCTOR Eitan Gurari, Dreese 495, 292-3083; email: gurari@cis.ohio-state.edu; office hours: MW, 12:30-1:20, and by appointment

GRADER Aiko Ishikawa Gringle (Assg. 1, 3, 5, 7, 9), wuh@cis.ohio-state.edu, Office hours: MW 3:30-4:20 and by appointment, DL 574;
Huaxing Hu (Assg. 2, 4, 6, 8, 10), gringle.2@osu.edu, 292-7036, DL474, cubicle #2, office hours: Friday 1:00 - 2:00Pm, and by appointment.

ASSIGNMENTS #1 (due We, April 7):1.1.1, 1.1.3
#2 (due We, April 14):1.2.3, 1.2.9 (g)
#3 (due We, April 21):1.3.3(d)
#4 (due We, April 28):2.2.3(i)
#5 (due We, May 5):2.3.2, 2.3.3
#6 (due We, May 12):2.4.2(d)
#7 (due We, May 19):2.5.3, 2.5.6
#8 (due Mo, May 24):3.2.1(d)
#9 (due Fr, May 28):3.3.3, 3.3.5
#10 (due We, June 2):3.4.2(d), 4.1.3(c)
Sketch of Solutions to earlier assignments