|
Links
Ministery of Higher Education
Ministery of Higher Education in
Erbil
Salahaddin University
University of Sulaimani
Koya University
University
of Kurdistan
|
Computation Theory
Total hours :90 theory.
The aim of this subject is:
learnt how to model system, these models used for the development of tools used for text-processing, compiler construction, hardware design, and artificial intelligence.
Subjects Names:
Automata and language ,Regular Language, Finite Automata , Formal definition of finite automata , Examples of finite automata, Formal definition of computation, Designing finite automata,
The regular operations.
Nondeterminism ,Formal definition of nondeterministic finite automaton , Equivalence of NFAs and DFAs , Closure under the regular operations, Formal definition of regular expression ,Equivalence with finite automata ,The pumping lemma for regular languages.
Context – Free Languages ,Formal definition of context –free grammar , Examples of context- free grammars, Ambiguity, Chomsky normal form, Pushdown Automata ,Formal definition of a pushdown automaton ,Examples of pushdown automata ,
Non-context –free Languages, The pumping Lemma for context –free languages.
***********************************************************
References :
- introduction to the theory of computation
by Michael sipser
- Introduction to computer theory
by Daneil I.A.Cohen.
|
