الخطة الدراسية

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.

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.

(( أستمارة الخطة التدريسية السنوية ))
فريال جاسم عبد الرزاق اسم التدريسي:
fryal.jassim@yahoo.com
البريد الالكتروني:
Computation Theory I
اسم المادة:
فصلي مقررالفصل:
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.



- أهداف المادة:
Memorize the Introductory to the Computational theory and Automata Languages.
1. Describe the basics of Set Notation.
2. Convert and system model to the BNF- Notation and to the Syntax Chart
3. develop the Equivalent Grammar, Type of Grammars, Context Sensitive Grammar
4. Determine the Context Free Grammar, Useless Symbols
5. Design models in Chomsky Normal Form CNF
6. Design models in Greibach Normal Form GNF
7. Remember Regular Grammars LEFT, RIGHT linear
8. Synthesize Finite State Automata with specific properties.
9. Discuss Non determinism NFA
10. Perform the Equivalent NFA with DFA
11. Perform the Equivalent DFA with Regular Grammar
12. Perform Equivalence Regular Grammar with NFA
13. Convert FA with and without Empty moves
14. Convert Equivalence NFA with and without Empty moves
15. Discuss Regular Expressions.
16. Analyze Equivalence of FA and Regular Expression. التفاصيل الاساسيه للمادة:
1. Daniel I. A. Cohen. Introduction to Computer Theory. 2nd ed .Wiley. 1996. ISBN-10: 0471137723 .
2. Sipser, Michael. Introduction to the Theory of Computation. 2nd ed. Boston, MA: Course Technology, 2006. ISBN: 0534950973.
3. Martin, John. Introduction to Languages and the Theory of Computation. New York, NY: McGraw Hill, 2002. ISBN: 0072322004.
4. Kozen, Dexter Automata and Computability .New York ,NY:Springer Verlag,1999.ISBN:0387949070.
الكتب المنهجية:
المصادر الخارجية:
الامتحان النهائي السعي المختبرات النظري الفصل الدراسي
%50 %50 %50 الاول
تقديرات الفصل:
معلومات اضافية:





جدول الدروس الأسبوعي – الفصل الدراسي الثاني
مفردات المقرر او المحتوى
INTRODUCTION TO COMPUTATION THEORY & SET THEORY:(set, string, alphabets and language). Week 1
LANGUAGES:(The Chomsky hierarchy of language ,The regular grammars and regular language, pumping lemma on regular languages ,closure properties of regular sets Week 2
Finite state Automata Week 3
D. Finite state Automata Week 4
Nondeterministic FSA
Finite state Automata with output(The Moore and Meal Machine) Week 5
Regular Expressions Week 6
Converting Regular expression into FSA and equivalence between D. Finite state Automata and Nondeterministic FSA Week 7
Formal languages, pumping lemma on regular languages Week 8
Syntax charts
BNF notation Week 9
Grammars and The ambiguous context free grammars. Week 10
Simplification of context free grammars: Chomsky Normal form Week 11
Greibach Normal form Week 12
Kleene Theorem , derivation tree Week 13
Closure properties of regular languages Week 14
context free grammars and languages, context free grammars without empty string production Week 15