Bahçeşehir University
Department of Computer Engineering
Course Syllabus 2010/2011-Spring
Course Code-Name: CMPE4003 Formal Languages and Automata Theory
Instructor Name: Dr. Tevfik Aytekin
Email: tevfik.aytekin@bahcesehir.edu.tr
Course Web Page: http://akademik.bahcesehir.edu.tr/~tevfik/courses/cmpe4003-2010-2011-Spring/
Teaching Assistant
Ceyhun Can Ülker
Announcements
The announcements will be posted on the course web page and on the OIS system . Check the course
web page and OIS messages regularly.
Textbook
Michael Sipser, “Introduction to the Theory of Computation” (2nd edition), 2006.
The textbook is required. We will closely follow the material in the textbook.
Course Outline
0. Introduction
1. Regular Languages
1.1. Finite Automata
1.2. Nondeterminism
1.3. Regular Expressions
1.4. Nonregular Languages
2. Context-Free Languages
2.1. Context-free Grammars
2.2. Pushdown Automata
2.3. Non-context-free Languages
3. Computability Theory
3.1. Turing Machines
3.2. Variants of Turing Machines
3.3. The Definition of Algorithm
Grading Policy
Midterm I (40%)
Final (%40)
Quizzes (10%)
Programming Project (10%)
Quizzes and Problem Sets
You will be given problem sets during the semester. You are not required to return the solutions,
solutions will be provided. Grading of these problem sets will be based on in-class quizzes. There will
be two quizzes: one before the midterm and one after the midterm, quiz dates will be announced later.
Quizzes will contain questions similar to the ones in the problem sets. So, It is important for you to try
to solve each question by your self before looking at the solutions. Even if you cannot solve a particular
problem you should study its solution when the solutions are provided.
Exams
The midterm and the final exams also will contain questions similar to the ones in the problem sets.
The pages of the textbook that you are responsible will be given on the course web page. You will be
responsible from everything that is covered on those pages.
Programming Project
In this project you will implement a simple regular expression engine. The details of the project will be
given later.
Midterm Dates
TBA
Plagiarism
Plagiarism (representing another person’s ideas or work as one’s own) is considered academic
dishonesty and will be punished with the maximum extent possible. If you have any questions about
plagiarism feel free to ask your instructor.