CmpE 350 - Formal Languages and Automata Theory

Spring Semester 2009

---

Announcements

• Results of final exam are here.
• Final exam grades will be announced on June 12, 2009 Friday. You may see your papers on June 12, 2009 Friday at 114:00.
• Final Exam:

Time: 8 June 2009 10:00

Place: NH 105

• You may see your second midterm papers on June 5, 2009 at 15:30 at ATA B5.
• Results of Midterm II are here. (Updated after objections)
• Midterm II

Time: 14 May 2009 13:00 – 14:50

Place: ETA A2 (AKBOYUN - GÜVEN)

NH 303 (ILIN - YÜZÜGÜLDÜ)

• Results of Midterm I are here. (Updated after objections)

You may see your papers on April 3, 2009 Friday between 12:30 – 13:30 at ETA 47.

• Midterm I

Time: 19 March 2009 13:00 – 14:50

Place: ETA A2 (AKBOYUN - GÜVEN)

NH 303 (ILIN - YÜZÜGÜLDÜ)

• The Problem Session on February, 26 2009 will be at NH 405. Check this page or your email before future problem sessions for a possible room change.
• Problem sessions will be held weekly on Thursdays between 15:00 and 17:00. The first PS is on 26/2/2009.
• Please register with the CmpE 350 mailing list from the department web site.
• The course announcements will be placed here, newer ones will be on top of older ones. Check frequently.

---

Catalog Data:	Strings and Languages. Classification of Grammars. Finite-state automata and regular expressions. Push-down automata and context-free grammars. Turing machines.
Textbook:	Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 2^nd Edition.
Instructor:	Cem Say
Teaching Assistants	Itır Karaç, Nuri Taşdemir

Prerequisite:

CmpE 220 or equivalent

Topics:

1. Strings and Languages
2. Finite Automata and Regular Languages
3. Context-free Languages
4. The Church-Turing Thesis
5. Decidability
6. Reducibility

Midterm dates:

Midterm I : TBA

Midterm II : TBA

Midterm places:

TBA

Computer Usage:

None

Laboratory projects:

None.

---