Finite automata and regular expressions. Pushdown automata and context-free grammars. Turing machines and Church's thesis. Undecidability. Computational complexity.
Site Navigation[Skip]
Sidebar[Skip]
Select Language
Teaching
2013-2014 (Computer Science and Biomedical Informatics, Univ. of Thessaly)
Updated: 12-Oct-2023 email: e<lastname>@dib.uth.gr