Baheehir University

Department of Computer Engineering

Course Syllabus 2016/2017-Spring

Course Code-Name: CMPE3004 Formal Languages and Automata Theory

Instructor Name: Dr. Tevfik Aytekin
Email: tevfik.aytekin@bahcesehir.edu.tr

Announcements
The announcements will be posted on the itslearning system, so check it 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
7. Time complexity (NP-completeness, example NP-complete problems, and reductions)

Grading Policy
Programming Project (20%)
Midterm (30%)
Final (50%)

Problem Sets
You will be given problem sets during the semester. You are not required to return the solutions,
solutions will be provided. Exams 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.
Programming Project
Details will be announced later.

Exams
The midterm and the final exams also will contain questions similar to the ones in the problem sets. You
are responsible from everything that is covered in the lectures.

Plagiarism
Plagiarism (representing another persons ideas or work as ones 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.