- Degree Bachelor
- Code: CS311
- Credit hrs: 3
- Prequisites: CS202
This course introduces the fundamental mathematical models of computation. The course presents both inherent capabilities and limitations of these computational models as well as their relationships with formal languages. Topics to be covered include: Finite automata and regular languages, deterministic and nondeterministic computations, pumping lemma for regular languages, context-free grammars and languages, pushdown automata, pumping lemma for context-free languages, and Turing machines and their variants.
Computer Science - 2021
Michael Sipser, Introduction to the Theory of Computation, Cengage Learning.
content serial | Description |
---|---|
1 | Deterministic Finite State Automata |
2 | Non-Deterministic Finite State Automata |
3 | Equivalence between DFA and NFA |
4 | Regular Expressions |
5 | Non-Regular Languages |
6 | Context-Free Grammars |
7 | Context-Free Grammars |
8 | 7th Week Exam |
9 | Push-Down Automata |
10 | Non-Context Free Languages |
11 | Turing Machines |
12 | Variants of Turing Machines |
13 | 12th Week Exam |
14 | Complexity Theory |
15 | Revision |
16 | Final exam |
Start your application