2 Credit Hour Course
Intended For Level 2 Term 2 Students
Prerequisite:
Language theory; Finite automata: deterministic finite automata, nondeterministic finite automata, equivalence and conversion of deterministic and nondeterministic finite automata, pushdown automata; Context free languages; Context free grammars; Turing Machines: basic machines, configuration, computing with Turing machines, combining Turing machines; Undecidability.
