|
Mathematical preliminaries; regular languages, finite automata, and regular expressions; nondeterminism and determinism in finite automata; finite automata minimisation; properties of regular languages; nonregular languages; context-free languages, context-free grammars, and pushdown automata; nondeterminism and determinism in pushdown automata; properties of context-free languages; non-context-free languages; multi-stack machines; Turing machines and Church Turing thesis; decidable and recognisable languages; undecidability of languages.
|