CS25E - Theory of Computing 1

This course uses the following course codes:

Number of credits: 4

This course has the following prerequisites:

This course has no corequisites.

The assessment for the course is as follows:

This course has coursework assessment.

In course assignments weight: 25%

Final exam: 75%

Finite automata and regular languages
State minimization Deterministic and non-deterministic finite automata Algorithmic aspects of finite automata

Context-free languages and pushdown automata
Context-free grammars Determinism and parsing