Advanced Formal Languages and Computing Complexity

Graduate

This course will cover the following topics: The Unsolvability of halting problems, decidable and semi-decidable languages, unrestricted grammars, the Chomsky hierarchy and beyond, computable functions, introduction to the analysis of complexity, time and space complexity classes.