Description
This course introduces the fundamental concepts of the Theory of Computation and formal models of computation. Topics include formal languages and regular expressions, deterministic and nondeterministic finite automata (DFA and NFA), conversion techniques between finite automata models, finite automata minimization algorithms, context-free languages and grammars, automata theory, pushdown automata and their corresponding languages, Turing machines, computability theory, undecidable problems, and computable functions. Emphasis is placed on the mathematical foundations of computation, language recognition, computational models, and the limits of algorithmic problem solving.
Credits
3 Hours