عام
Computation Theory (601322)
Dr. Shakir AlFarraji
Description:This course covers: Regular Languages (RLs), representation of infinite RLs in finite form by Regular Expression (RE), generating RLs by REs, recognition of RLs by Finite Automata (FA); Deterministic FA (DFA) and non-deterministic FA (NDFA) will be presented,; Converting the NDFA to its equivalent DFA; Pumping theorem to check if a language is a RL; Context-Free-Languages (CFLs), generating CFLs by Context-Free-Grammar (CFG), converting CFG to Chomsky Normal Form (CNF), Top-Down and Bottom-Up parsing, ambiguity, recognition of CFLs by Pushdown Automata (PDA); Extended pumping theorem to check if a language is a CFL; Context-Sensitive-Languages (CSLs), generating CSLs by Context Sensitive Grammar (CSG), recognition of CSLs by Turing Machine(TM), Halting problem.
