الخطة الدراسية السنوية للاحتسابية 2012-2013

Computation Theory

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 to:
1. Memorize the Introductory to the Computational theory and Automata Languages.
2. Describe the basics of Set Notation.
3. Convert and system model to the BNF- Notation and to the Syntax Chart
4. evelop the Equivalent Grammar, Type of Grammars, Context Sensetive Grammar
5. Determine the Context Free Grammar, Useless Symbols
6. Design models in Chomsky Normal Form CNF
7. Design models in Greibach Normal Form GNF
8. Remember Regular Grammars LEFT, RIGHT linear
9. Synthesize Finite State Automata with specific properties.
10. Discuss Nondeterminism NFA
11. Perform the Equivalent NFA with DFA
12. Perform the Equivalent DFA with Regular Grammar
13. Perform Equivalence Regular Grammar with NFA
14. Convert FA with and without Empty moves
15. Convert Equivalence NFA with and without Empty moves
16. Discuss Regular Expressions.
17. Analyze Equivalence of FA and Regular Expression
18. Convert between Tow Way FA s.
19. Use Turing Machines
20. Design Turing Machines
21. Analyze Turing Machines
22. Analyze Turing Machines
23. Analyze Turing Machines
24. Design Pushdown Automata