‫جمهورية العراق‬
‫وزارة التعليم العالي والبحث العلمي‬
‫وثق ما تفعل‬
‫جامعة بابل‬
‫وافعل ما توثق‬
‫كلية تكنولوجيا المعلومات‬
‫قسم البرامجيات‬
‫الدراسات األولية‬
‫إدارة الجودة الشاملة‬
‫رقم المقرر الدولي‪:‬‬
‫‪COTH201‬‬
‫‪Course NO.: COTH201‬‬
‫‪1‬‬
‫اسم المقرر‬
‫اجباري‪:‬‬
‫‪Curriculum and Process Design Evidence‬‬
‫)‪CAPDE(7-3-1.2.3.-02-01‬‬
‫العدد‪:‬‬
‫استمارة خاصة الطالع الطلبة على المقرر‬
‫التاريخ‪:‬‬
‫النوع‬
‫‪Computation theory‬‬
‫اختياري‪:‬‬
‫‪X‬‬
‫‪2‬‬
‫عدد الوحدات‬
‫‪3‬‬
‫المرحلة الدراسية‬
‫عدد الساعات االجمالي‬
‫‪3‬‬
‫‪ 4‬اسم التدريسي‬
‫الشهادة واللقب العلمي‬
‫‪ 5‬لغة تدريس المقرر‬
‫فصلي ‪X‬‬
‫سنوي‬
‫‪3‬‬
‫النظري‬
‫‪3‬‬
‫العملي‬
‫الثانية‬
‫هبه محمد جعفر‬
‫ماجستير علوم حاسبات ‪ /‬مدرس‬
‫انكليزي‬
‫برنامج المقرر‬
‫اوال‬
‫المقدمة‬
‫‪On completion of this course, students will be able to explain the‬‬
‫‪basic methods and conclusions of the Theory of Computation. They will‬‬
‫‪be able to apply these methods to problems from different fields and be‬‬
‫‪guided by the results in searching for computational solutions to the‬‬
‫‪problems. In particular, students will be able understand these concepts‬‬
‫‪carefully.‬‬
‫(‪)1 - 3‬‬
‫اهداف المقرر‬
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
‫ثانيا‬
Memorize the Introductory to the Computational theory and Automata
Languages.
Describe the basics of Set Notation.
Convert and system model to the BNF- Notation and to the Syntax Chart
develop the Equivalent Grammar, Type of Grammars, Context Sensitive
Grammar
Determine the Context Free Grammar, Useless Symbols
Design models in Chomsky Normal Form CNF
Design models in Greibach Normal Form GNF
Remember Regular Grammars LEFT, RIGHT linear
Synthesize Finite State Automata with specific properties.
Discuss Nondeterminism NFA
Perform the Equivalent NFA with DFA
Perform the Equivalent DFA with Regular Grammar
Perform Equivalence Regular Grammar with NFA
Convert FA with and without Empty moves
Convert Equivalence NFA with and without Empty moves
Discuss Regular Expressions.
Analyze Equivalence of FA and Regular Expression
Convert between Tow Way FA's.
Use Turing Machines
Design Turing Machines
Analyze Turing Machines
Week 1
‫مفردات المقرر او المحتوى‬
INTRODUCTION TO COMPUTATION THEORY & SET THEORY
Week 2
LANGUAGES
Week 3
Finite state Automata
Week 4
D. Finite state Automata
Week 5
Nondeterministic FSA
Week 6
Regular Expressions
Week 7
Converting Regular expression into FSA
Week 8
Formal languages
Week 9
Syntax charts
BNF notation
Week 10
grammars
)2 - 3(
‫ثالثا‬
Week 11
Chomsky Normal form
Week 12
Greibach Normal form
Week 13
Kleene Theorem
Week 14
Week 15
Two-Way FA
TURING MACHINE
‫مفردات المقرر او المحتوى‬
‫ثالثا‬
‫طرائق التدريس المعتمدة لتنفيذ المقرر‬
‫رابعا‬
1- Lectures.
2- Discussion.
3- Interaction between the lecturer and the students by questions.

homework assignments, quizzes

Exams
‫توزع درجات المقرر وفق لواحد أو أكثر مما يأتي‬
‫خامسا‬
: - ‫ التسلسل حسب األهمية‬- ‫المصادر والمراجع‬
‫سادسا‬
1. Final exam
1.
2.
3.
4.
Daniel I. A. Cohen. Introduction to Computer Theory. 2nd ed .Wiley.
1996. ISBN-10: 0471137723 .
Sipser, Michael. Introduction to the Theory of Computation. 2nd ed.
Boston, MA: Course Technology, 2006. ISBN: 0534950973.
Martin, John. Introduction to Languages and the Theory of
Computation. New York, NY: McGraw Hill, 2002. ISBN:
0072322004.
Kozen, Dexter Automata and Computability .New York ,NY:Springer
Verlag,1999.ISBN:0387949070.
‫ صفاء عبيس‬.‫ د‬:‫رئيس القسم‬
‫ هبه محمد جعفر‬:‫اسم التدريسي‬
:‫التوقيع‬
:‫التوقيع‬
)3 - 3(