King Abdullah II School of Information Technology - The University of Jordan

There are no items to show in this view.

( Theory of Computation)

Course Description :

Sets, Relations, Closure and Languages, Finite Automata, deterministic and nondeterministic, Closure and pumping lemma, Regular languages and expressions, Context-Free Grammar, Regular languages and Context-Free languages, pushdown automata, closure, determinism and parsing, LL (1) Grammar, Turing machines and machine schemas, examples, Introduction to P and NP classes.

Pre Request :

Credit Hour :

Department :

Computer%20Science

Program :

Bachelor%20Of%20Computer%20Science

Course Level :

Bachelor

Course Outline :

1901241-Theory of Computation.pdf