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).
GRADING POLICY
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 | ||