CmpE 350 - Formal Languages and Automata Theory

Summer Semester 2004

 


 

Announcements

·        Here are the grades of the final exam. You can see your papers ONLY on August 9, between 16:00 and 16:30.

Student ID

final

9611129

7

9700976

98

9803013

56

9902485

12

9907589

38

2000100103

35

2000100418

30

2000100859

57

2000103310

26

2000400026

28

2001100799

27

2001103232

79

2002100046

80

2003900114

35

2003900138

17

 

·        The final exam’s time and location are as announced on the University’s Summer Term website.

·        No office hour at 17:00 on July 30.

·        Here are your MT2 grades. You can see your papers in the office hours on Wednesday.

Student ID

MT2

9611129

22

9700976

70

9803013

32

9902485

37

9907589

38

2000100103

53

2000100418

29

2000100859

87

2000103310

28

2000400026

42

2001100799

36

2001103232

56

2002100046

35

2003900114

52

2003900115

0

2003900138

54

 

·        No office hour preceding the lecture on July 15.

·        Here are your MT1 grades. You can see your papers in the office hours on July 14. (Note that office hours end at 17:30 on that day.)

Student ID

MT1

9611129

17

9700976

93

9803013

69

9902485

25

9907589

60

2000100103

21

2000100418

49

2000100859

80

2000103310

84

2000400026

57

2001100799

22

2001103232

75

2002100046

72

2003900114

62

2003900115

2

2003900138

46

 

·        THE MIDTERM EXAMS WILL BE HELD IN ETA Z04.

·        No office hour at 17:00 on July 7.

·        Office hours: 14:00-15:00 and 17:00-18:00 on days on which we have lectures. (Exceptions will be announced.)

·        Starting Wednesday, June 30, the location for the lectures is the Computer Engineering Department Seminar Room, (ETA311), in the third floor.

·        We have no lecture on Friday, June 25. To compensate, we will have a lecture on Friday, July 2, between 15:00 and 17:00. (That Friday is normally off, because of the graduation ceremonies, but we shall not care about that.)

·  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, 1997.

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.