Finite automata and regular expressions. Pushdown automata and context-free grammars. Turing machines and Church's thesis. Undecidability. Computational complexity.
Updated: 25-Nov-2011 email: emarkou@ucg.gr