Year:
Jordan University of Science & Technology
Faculty of Computer & Information Technology
Department of Computer Science
2012/2013
Semester:
Second
Course Information
Course Title
Course Number
Prerequisites
Course Website
Instructor
Office Location
Office Phone
Office Hours
Teaching Assistant
E-mail
Theory of Computation
CS 282
CS 112: Intr. To Object-Oriented Programming
Math 241A: Discrete Mathematics
http://www.just.edu.jo/~misaleh
Dr. Mohammed Al-Saleh
Ph 4 Level -1
7201000 Ext. 23916
Sunday/ Tuesday/ Thursday from
12:15pm to 1:15pm
???
misaleh@just.edu.jo
Text Book
Title
An Introduction to Formal Languages and Automata
Book Face
Author(s)
Publisher
Year
Edition
Book Website


References


Peter Linz
Jones and Bartlett
2006
4th
http://www.jblearning.com/catalog/9780763737986/
Introduction to Languages and the Theory of Computation, John Martin, 3rd
Ed., Mc Graw Hill, 2003.
Elements of the Theory of Computation, H. Lewis and C. Papadimitrios,
2nd Edition, 1998 by Prentice Hall, Inc.
Introduction to Computer Theory, Daniel Cohen, 1997, John Wiley & Sons.
J. Hopcroft, R. Motwani, and J. Ullman, “Introduction to Automata
Theory, Languages, and Computation”, 2nd Ed., Addison Wesley, 2001.
Assessment Policy
Assessment Type
First Exam
Second Exam
Final Exam
Quizzes
Expected Due Date
Week 5 or 6
Week 11 or 12
TBA
Every other Thursday
Weight
25%
25%
40%
10%
Teaching & Learning Methods
 Class lectures, lecture notes, exams, and the textbook are designed to achieve the course
objectives.
 You should read the assigned chapters before class, complete assignments on time, participate
in class and do whatever it takes for you to grasp this material. Ask questions.
 You are responsible for all material covered in the class.
 Please communicate any concerns or issues as soon as practical either in class or by email.
 The web page is a primary communication vehicle.
Course Objectives
To understand mathematical proofs, concepts, notations, and techniques of the theories of Automata,
Formal Languages, and Turing machines. By the end of this course in computing theory, students will
be able to:
 understand the theory of compatibility and complexity
 get to know what can be solved by computers and what that can not.
 identify the differences between the classes of languages
 express the languages using (non)deterministic finite automata/regular expressions,
context-free grammars/pushdown automata, and Turing machines
 use induction to prove theories
Course Content (Tentative)
Week
Topics
1
2, 3
4, 5, 6
7
8, 9, 10
11
12, 13, 14
15
Review of Mathematical Preliminaries
Finite Automata
Regular Languages and Regular Grammars
Properties of Regular Languages
Context-Free Languages
Simplification of Context-Free Grammars
Pushdown Automata & CFL
Turing Machines and variations
Chapter in
Text
1
2
3
4
5
6
7
9
Additional Notes


Quizzes (5-10 minutes) will be given at the end of the lecture. Typically they will
involve simple questions that are designed to test the understanding of the
material discussed in the preceding lectures.
Every other Thursday
Cheating


Standard JUST policy will be applied.
All graded assignments must be your own work (your own words).
Attendance

JUST policy requires the faculty member to assign ZERO grade (35) if a student
misses 10% of the classes that are not excused.
Medicine/Engineering building problem: have to bring the schedule and 5
minutes max late
Encouraged
Quizzes

Participation
