CmpE 350 - Formal Languages and Automata Theory

Summer Semester 2005

---

Announcements

• UPDATED TIME: The remaining extra lecture will take place at 17:00-18:00 on Wednesday, August 3. Recall that there is no lecture on Friday, June 29.
• Objection results have been reflected (in red) in the grade table below.
• Here are your second midterm grades. You can see your papers on Wednesday, July 27, at 14:00-15:00 in my office.

Student ID	Midterm2
2001103799	1
2000103568	8
2001102509	25
9902035	NP
2002103316	47
2001102338	4
2001400007	12
2001103304	31
2004900183	37
2001101852	27
2001103505	NP
2001101192	33
2001103151	12
2001100799	35
2003102542	62
2002103928	30
2001102464	50
2001102743	5
2001400015	36
2004721407	49
9803406	43
2001101312	46
2003101726	52
2000100946	34
2002103583	38
2001103928	99
9902485	22

• There will be no lecture on Friday, and we will decide when to hold extra lectures for compensation on Tuesday, July 26, so make sure you come to the lecture on Tuesday.
• Here are your midterm grades. You can see your papers in the office hour on Friday.

Student ID	Midterm1
2001103799	19
2000103568	24
2001102509	37
9902035	NP
2002103316	40
2001102338	45
2001400007	46
2001103304	10
2004900183	74
2001101852	30
2001103505	NP
2001101192	49
2001103151	34
2001100799	36
2003102542	66
2002103928	43
2001102464	46
2001102743	23
2001400015	20
2004721407	80
9803406	47
2001101312	93
2003101726	73
2000100946	30
2002103583	18
2001103928	70
9902485	21

• The midterm exams will be held in ETAZ04.

· New course location: ETA 311.

• Office hours: 14:00-15:00 on days on which we have lectures. (Starting June 28.) Exceptions will be announced.

· 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. (Second Edition) Course Technology, 2005.
Instructor:	Cem Say

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: (midterms will be held during the lecture hours)

July 8
July 22

Computer Usage:

None

Laboratory projects:

None.

---