المواد الدراسية
In-depth study of concepts related to computability - Chomsky hierarchy - Turing machines – Computability - Decidability - Nondeterministic automats, recursive function theory - Theory of complexity and complexity classification.
Course Plan
PART I...
Details of the course are available in the Department of Computer Science Study plan. The used reference is "Compilers : principles, techniques and tools, second edition by AHO et al " The Dragon book"
Students are expected to design a working...
This course is a series of lecture notes delivered to the M.Sc. students. Students succesfully publish an IEEE paper on state of the art distributed real time systems applications.